./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:52:19,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:52:19,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:52:19,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:52:19,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:52:19,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:52:19,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:52:20,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:52:20,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:52:20,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:52:20,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:52:20,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:52:20,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:52:20,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:52:20,003 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:52:20,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:52:20,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:52:20,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:52:20,004 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:52:20,004 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:52:20,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:52:20,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:52:20,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:52:20,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:52:20,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:52:20,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:52:20,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:52:20,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:52:20,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:52:20,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:52:20,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:52:20,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:52:20,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:52:20,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:52:20,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e [2024-10-13 10:52:20,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:52:20,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:52:20,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:52:20,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:52:20,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:52:20,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2024-10-13 10:52:21,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:52:21,798 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:52:21,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2024-10-13 10:52:21,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4972ebb62/1d9cb5cd6a6a4a9a8340093d60589eb3/FLAGf1419e89f [2024-10-13 10:52:21,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4972ebb62/1d9cb5cd6a6a4a9a8340093d60589eb3 [2024-10-13 10:52:21,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:52:21,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:52:21,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:52:21,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:52:21,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:52:21,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:52:21" (1/1) ... [2024-10-13 10:52:21,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae8007d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:21, skipping insertion in model container [2024-10-13 10:52:21,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:52:21" (1/1) ... [2024-10-13 10:52:21,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:52:22,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:52:22,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:52:22,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:52:22,273 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:52:22,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22 WrapperNode [2024-10-13 10:52:22,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:52:22,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:52:22,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:52:22,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:52:22,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,317 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-10-13 10:52:22,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:52:22,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:52:22,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:52:22,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:52:22,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,346 INFO L175 MemorySlicer]: Split 18 memory accesses to 1 slices as follows [18]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-10-13 10:52:22,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:52:22,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:52:22,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:52:22,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:52:22,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (1/1) ... [2024-10-13 10:52:22,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:52:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:22,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:52:22,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:52:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-10-13 10:52:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-13 10:52:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:52:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:52:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:52:22,567 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:52:22,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:52:22,892 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-13 10:52:22,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:52:22,956 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:52:22,957 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-13 10:52:22,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:52:22 BoogieIcfgContainer [2024-10-13 10:52:22,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:52:22,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:52:22,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:52:22,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:52:22,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:52:21" (1/3) ... [2024-10-13 10:52:22,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4cb881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:52:22, skipping insertion in model container [2024-10-13 10:52:22,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:22" (2/3) ... [2024-10-13 10:52:22,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4cb881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:52:22, skipping insertion in model container [2024-10-13 10:52:22,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:52:22" (3/3) ... [2024-10-13 10:52:22,967 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-inline.i [2024-10-13 10:52:22,981 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:52:22,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-10-13 10:52:23,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:52:23,051 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5920fcb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:52:23,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-10-13 10:52:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:52:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:52:23,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:23,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:52:23,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 7603434, now seen corresponding path program 1 times [2024-10-13 10:52:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207287411] [2024-10-13 10:52:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:23,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:23,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207287411] [2024-10-13 10:52:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207287411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:23,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:52:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968647373] [2024-10-13 10:52:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:52:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:52:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:23,350 INFO L87 Difference]: Start difference. First operand has 96 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:23,452 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-10-13 10:52:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:52:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:52:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:23,461 INFO L225 Difference]: With dead ends: 94 [2024-10-13 10:52:23,461 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:52:23,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:23,465 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:23,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:52:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 10:52:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 84 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:52:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-13 10:52:23,499 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 4 [2024-10-13 10:52:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:23,500 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-13 10:52:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-13 10:52:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:52:23,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:23,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:52:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:52:23,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 7603435, now seen corresponding path program 1 times [2024-10-13 10:52:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442403885] [2024-10-13 10:52:23,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442403885] [2024-10-13 10:52:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442403885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:52:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771534350] [2024-10-13 10:52:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:52:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:52:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:23,607 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:23,691 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-10-13 10:52:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:52:23,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:52:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:23,693 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:52:23,693 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:52:23,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:23,694 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:23,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:52:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 10:52:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 44 states have (on average 2.022727272727273) internal successors, (89), 82 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:52:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-10-13 10:52:23,708 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 4 [2024-10-13 10:52:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:23,708 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-10-13 10:52:23,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-10-13 10:52:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:52:23,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:23,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:52:23,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 36302357, now seen corresponding path program 1 times [2024-10-13 10:52:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729079793] [2024-10-13 10:52:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:23,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729079793] [2024-10-13 10:52:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729079793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:23,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:52:23,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132389650] [2024-10-13 10:52:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:23,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:52:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:52:23,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:23,840 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:23,994 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-10-13 10:52:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:52:23,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:52:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:23,996 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:52:23,996 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:52:23,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:23,998 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:24,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:52:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 10:52:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 44 states have (on average 2.0) internal successors, (88), 81 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:52:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-13 10:52:24,015 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2024-10-13 10:52:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:24,020 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-13 10:52:24,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-13 10:52:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:52:24,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:24,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:24,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:52:24,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:24,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 36302358, now seen corresponding path program 1 times [2024-10-13 10:52:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8962509] [2024-10-13 10:52:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:24,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8962509] [2024-10-13 10:52:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8962509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:24,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:52:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048492468] [2024-10-13 10:52:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:24,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:52:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:52:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:24,154 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:24,278 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-10-13 10:52:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:52:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:52:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:24,281 INFO L225 Difference]: With dead ends: 89 [2024-10-13 10:52:24,282 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 10:52:24,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:24,285 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:24,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 10:52:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 10:52:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 80 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:52:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-10-13 10:52:24,298 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2024-10-13 10:52:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:24,298 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-10-13 10:52:24,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-10-13 10:52:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:52:24,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:24,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:24,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:52:24,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:24,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2067485473, now seen corresponding path program 1 times [2024-10-13 10:52:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549718708] [2024-10-13 10:52:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549718708] [2024-10-13 10:52:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549718708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:24,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798168451] [2024-10-13 10:52:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:24,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:24,592 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:24,927 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-10-13 10:52:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-13 10:52:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:24,929 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:52:24,929 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:52:24,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:52:24,930 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:24,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 279 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:52:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 10:52:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 80 states have internal predecessors, (89), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 10:52:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-13 10:52:24,938 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 15 [2024-10-13 10:52:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:24,939 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-13 10:52:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-13 10:52:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:52:24,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:24,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:24,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:52:24,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2067485474, now seen corresponding path program 1 times [2024-10-13 10:52:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42950495] [2024-10-13 10:52:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42950495] [2024-10-13 10:52:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42950495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:25,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:52:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971725405] [2024-10-13 10:52:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:52:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:52:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:52:25,242 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:25,567 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-10-13 10:52:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:25,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-13 10:52:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:25,569 INFO L225 Difference]: With dead ends: 109 [2024-10-13 10:52:25,570 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 10:52:25,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:25,571 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:25,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 374 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 10:52:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-10-13 10:52:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 92 states have internal predecessors, (106), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-10-13 10:52:25,582 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 15 [2024-10-13 10:52:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:25,583 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-10-13 10:52:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-10-13 10:52:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:52:25,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:25,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:52:25,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 94334936, now seen corresponding path program 1 times [2024-10-13 10:52:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16121507] [2024-10-13 10:52:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16121507] [2024-10-13 10:52:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16121507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402334226] [2024-10-13 10:52:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:25,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:25,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:25,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:25,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:52:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:52:25,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:25,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:26,007 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-13 10:52:26,038 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:52:26,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:52:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:52:26,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402334226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:26,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2024-10-13 10:52:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961626839] [2024-10-13 10:52:26,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:52:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:52:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:52:26,188 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:52:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:26,439 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-10-13 10:52:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:52:26,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19 [2024-10-13 10:52:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:26,440 INFO L225 Difference]: With dead ends: 105 [2024-10-13 10:52:26,440 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 10:52:26,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-13 10:52:26,441 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:26,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 310 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2024-10-13 10:52:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 10:52:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-13 10:52:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 91 states have internal predecessors, (106), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-10-13 10:52:26,446 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 19 [2024-10-13 10:52:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:26,447 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-13 10:52:26,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:52:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-10-13 10:52:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:52:26,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:26,451 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:26,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:52:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:26,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 94334937, now seen corresponding path program 1 times [2024-10-13 10:52:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407239233] [2024-10-13 10:52:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407239233] [2024-10-13 10:52:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407239233] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336309833] [2024-10-13 10:52:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:26,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:26,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:26,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:52:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:52:27,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:27,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:27,103 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-13 10:52:27,122 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:52:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:52:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:52:27,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336309833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:27,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-13 10:52:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446679244] [2024-10-13 10:52:27,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:52:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:52:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:52:27,338 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 10:52:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:27,593 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-10-13 10:52:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 19 [2024-10-13 10:52:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:27,594 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:52:27,594 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 10:52:27,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-10-13 10:52:27,595 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:27,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 434 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2024-10-13 10:52:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 10:52:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-13 10:52:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 89 states have internal predecessors, (103), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-10-13 10:52:27,599 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 19 [2024-10-13 10:52:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:27,599 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-10-13 10:52:27,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 10:52:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-10-13 10:52:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:52:27,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:27,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:27,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:52:27,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 10:52:27,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:27,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash 755943574, now seen corresponding path program 1 times [2024-10-13 10:52:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797339646] [2024-10-13 10:52:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797339646] [2024-10-13 10:52:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797339646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:52:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666915701] [2024-10-13 10:52:27,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:27,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:52:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:52:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:52:27,889 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:28,027 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2024-10-13 10:52:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:52:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-13 10:52:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:28,028 INFO L225 Difference]: With dead ends: 123 [2024-10-13 10:52:28,028 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 10:52:28,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:28,029 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:28,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 225 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 10:52:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2024-10-13 10:52:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.7123287671232876) internal successors, (125), 101 states have internal predecessors, (125), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:52:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2024-10-13 10:52:28,034 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 20 [2024-10-13 10:52:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:28,034 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2024-10-13 10:52:28,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2024-10-13 10:52:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:52:28,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:28,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:28,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:52:28,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:28,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:28,035 INFO L85 PathProgramCache]: Analyzing trace with hash 755943575, now seen corresponding path program 1 times [2024-10-13 10:52:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:28,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894499785] [2024-10-13 10:52:28,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:28,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894499785] [2024-10-13 10:52:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894499785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908465899] [2024-10-13 10:52:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:28,186 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:28,389 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2024-10-13 10:52:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:28,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-13 10:52:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:28,390 INFO L225 Difference]: With dead ends: 128 [2024-10-13 10:52:28,390 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 10:52:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:52:28,391 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 29 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:28,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 425 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 10:52:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-10-13 10:52:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 107 states have internal predecessors, (135), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:52:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2024-10-13 10:52:28,399 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 159 transitions. Word has length 20 [2024-10-13 10:52:28,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:28,400 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 159 transitions. [2024-10-13 10:52:28,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2024-10-13 10:52:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:52:28,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:28,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:28,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:52:28,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:28,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 612271540, now seen corresponding path program 1 times [2024-10-13 10:52:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:28,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065178634] [2024-10-13 10:52:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:28,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065178634] [2024-10-13 10:52:28,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065178634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:28,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:28,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424815877] [2024-10-13 10:52:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:28,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:52:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:28,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:52:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:28,514 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:28,641 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2024-10-13 10:52:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:52:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-13 10:52:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:28,642 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:52:28,642 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:52:28,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:28,643 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:28,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 413 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:52:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-13 10:52:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.675) internal successors, (134), 108 states have internal predecessors, (134), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:52:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2024-10-13 10:52:28,651 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 22 [2024-10-13 10:52:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2024-10-13 10:52:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2024-10-13 10:52:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:52:28,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:28,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:28,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:52:28,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 612415883, now seen corresponding path program 1 times [2024-10-13 10:52:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938159139] [2024-10-13 10:52:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938159139] [2024-10-13 10:52:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938159139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 10:52:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027910752] [2024-10-13 10:52:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:28,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:52:28,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:52:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:28,965 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:29,254 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2024-10-13 10:52:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:52:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-13 10:52:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:29,255 INFO L225 Difference]: With dead ends: 137 [2024-10-13 10:52:29,255 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 10:52:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:52:29,256 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 40 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:29,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 536 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 10:52:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2024-10-13 10:52:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 113 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:52:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-10-13 10:52:29,264 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 22 [2024-10-13 10:52:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:29,264 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-10-13 10:52:29,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-10-13 10:52:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:52:29,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:29,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:52:29,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 612415884, now seen corresponding path program 1 times [2024-10-13 10:52:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892508095] [2024-10-13 10:52:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892508095] [2024-10-13 10:52:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892508095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:29,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 10:52:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363211837] [2024-10-13 10:52:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:52:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:52:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:52:29,643 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:29,967 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2024-10-13 10:52:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:52:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-13 10:52:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:29,968 INFO L225 Difference]: With dead ends: 137 [2024-10-13 10:52:29,968 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 10:52:29,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:52:29,968 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:29,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 633 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 10:52:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2024-10-13 10:52:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 113 states have internal predecessors, (140), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:52:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2024-10-13 10:52:29,974 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 22 [2024-10-13 10:52:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:29,974 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2024-10-13 10:52:29,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2024-10-13 10:52:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:52:29,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:29,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:52:29,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:29,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1358917054, now seen corresponding path program 1 times [2024-10-13 10:52:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494464354] [2024-10-13 10:52:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494464354] [2024-10-13 10:52:30,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494464354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030317179] [2024-10-13 10:52:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:30,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:30,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:30,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:52:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-13 10:52:30,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:30,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:30,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:52:30,545 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-10-13 10:52:30,571 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 10:52:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-13 10:52:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:52:30,652 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-13 10:52:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:52:30,683 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 10:52:30,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 10:52:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:52:30,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030317179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:30,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-10-13 10:52:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854216697] [2024-10-13 10:52:30,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:30,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:52:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:52:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=2, NotChecked=82, Total=552 [2024-10-13 10:52:30,814 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:52:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:31,385 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2024-10-13 10:52:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2024-10-13 10:52:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:31,386 INFO L225 Difference]: With dead ends: 131 [2024-10-13 10:52:31,386 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 10:52:31,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=601, Unknown=2, NotChecked=102, Total=812 [2024-10-13 10:52:31,387 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 67 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:31,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 418 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 627 Invalid, 0 Unknown, 224 Unchecked, 0.4s Time] [2024-10-13 10:52:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 10:52:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-10-13 10:52:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 105 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-10-13 10:52:31,390 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 23 [2024-10-13 10:52:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-10-13 10:52:31,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:52:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-10-13 10:52:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:52:31,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:31,391 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:31,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:31,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:31,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 121178125, now seen corresponding path program 1 times [2024-10-13 10:52:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292865804] [2024-10-13 10:52:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292865804] [2024-10-13 10:52:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292865804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764734708] [2024-10-13 10:52:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:32,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:32,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:52:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:52:32,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:52:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-13 10:52:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:32,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:52:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764734708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:52:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2024-10-13 10:52:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403147788] [2024-10-13 10:52:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:32,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:52:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:52:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:52:32,398 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:32,568 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2024-10-13 10:52:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-10-13 10:52:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:32,569 INFO L225 Difference]: With dead ends: 126 [2024-10-13 10:52:32,569 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 10:52:32,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:52:32,570 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:32,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 513 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 10:52:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2024-10-13 10:52:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 106 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-13 10:52:32,576 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 24 [2024-10-13 10:52:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:32,577 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-13 10:52:32,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-13 10:52:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:52:32,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:32,579 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:32,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 10:52:32,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 121236201, now seen corresponding path program 1 times [2024-10-13 10:52:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588548227] [2024-10-13 10:52:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588548227] [2024-10-13 10:52:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588548227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872117204] [2024-10-13 10:52:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:33,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:33,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:52:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:33,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 10:52:33,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:33,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:33,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:33,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:33,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-13 10:52:33,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-13 10:52:33,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:52:33,769 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-10-13 10:52:33,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-10-13 10:52:33,779 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:52:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-10-13 10:52:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:33,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:34,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:34,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 526 treesize of output 524 [2024-10-13 10:52:34,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:34,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1277 treesize of output 1250 [2024-10-13 10:52:37,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872117204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:37,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:37,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2024-10-13 10:52:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501507900] [2024-10-13 10:52:37,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:37,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 10:52:37,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 10:52:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:52:37,850 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:38,420 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2024-10-13 10:52:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:52:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-13 10:52:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:38,421 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:52:38,421 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:52:38,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 10:52:38,422 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:38,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1204 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:52:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:52:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-13 10:52:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.5875) internal successors, (127), 107 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2024-10-13 10:52:38,425 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 24 [2024-10-13 10:52:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:38,425 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-10-13 10:52:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2024-10-13 10:52:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:52:38,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:38,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:38,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:52:38,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 10:52:38,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -799220620, now seen corresponding path program 1 times [2024-10-13 10:52:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:38,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14456512] [2024-10-13 10:52:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 10:52:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:52:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14456512] [2024-10-13 10:52:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14456512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504472846] [2024-10-13 10:52:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:38,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:38,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:52:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:38,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:52:38,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:38,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:38,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:38,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 10:52:38,973 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-13 10:52:38,983 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:52:38,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:52:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:52:38,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504472846] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:39,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-10-13 10:52:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091102255] [2024-10-13 10:52:39,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:52:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:52:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-10-13 10:52:39,062 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:52:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:39,312 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2024-10-13 10:52:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2024-10-13 10:52:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:39,313 INFO L225 Difference]: With dead ends: 123 [2024-10-13 10:52:39,313 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 10:52:39,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:52:39,314 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:39,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 515 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 490 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2024-10-13 10:52:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 10:52:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-10-13 10:52:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.575) internal successors, (126), 106 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-13 10:52:39,318 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 27 [2024-10-13 10:52:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-13 10:52:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:52:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-13 10:52:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:52:39,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:39,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:39,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:52:39,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 10:52:39,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -799220619, now seen corresponding path program 1 times [2024-10-13 10:52:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264031726] [2024-10-13 10:52:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 10:52:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264031726] [2024-10-13 10:52:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264031726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807327208] [2024-10-13 10:52:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:39,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:39,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:52:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:39,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:52:39,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:39,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:39,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:39,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 10:52:39,960 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-13 10:52:39,972 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:52:39,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:52:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:52:39,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807327208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:40,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2024-10-13 10:52:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530179767] [2024-10-13 10:52:40,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:52:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:52:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-10-13 10:52:40,037 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:52:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:40,267 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2024-10-13 10:52:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-10-13 10:52:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:40,268 INFO L225 Difference]: With dead ends: 120 [2024-10-13 10:52:40,268 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 10:52:40,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-10-13 10:52:40,269 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:40,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 497 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2024-10-13 10:52:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 10:52:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-10-13 10:52:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 104 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2024-10-13 10:52:40,276 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 27 [2024-10-13 10:52:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:40,276 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2024-10-13 10:52:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:52:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2024-10-13 10:52:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:52:40,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:40,277 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:40,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:40,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:40,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:40,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 543906283, now seen corresponding path program 1 times [2024-10-13 10:52:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230348219] [2024-10-13 10:52:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230348219] [2024-10-13 10:52:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230348219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009185859] [2024-10-13 10:52:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:40,878 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:40,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:52:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:40,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:52:40,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:40,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:41,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:41,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:41,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:52:41,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:52:41,167 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_61 Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| v_alloc_and_zero_internal_~pi~1.base_61 (select |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_61))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_61) 0) (= (store |c_old(#memory_$Pointer$#0.offset)| v_alloc_and_zero_internal_~pi~1.base_61 (select |c_#memory_$Pointer$#0.offset| v_alloc_and_zero_internal_~pi~1.base_61)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-10-13 10:52:41,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 10:52:41,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:41,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 10:52:41,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:41,270 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-10-13 10:52:41,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2024-10-13 10:52:41,289 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-10-13 10:52:41,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2024-10-13 10:52:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:41,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:41,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009185859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:41,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2024-10-13 10:52:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660750874] [2024-10-13 10:52:41,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:41,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:52:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:52:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2024-10-13 10:52:41,810 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:42,520 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2024-10-13 10:52:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:52:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-10-13 10:52:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:42,521 INFO L225 Difference]: With dead ends: 120 [2024-10-13 10:52:42,521 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 10:52:42,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=1061, Unknown=1, NotChecked=66, Total=1260 [2024-10-13 10:52:42,525 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 14 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:42,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 892 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 739 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-10-13 10:52:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 10:52:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-13 10:52:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 106 states have internal predecessors, (126), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2024-10-13 10:52:42,529 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 26 [2024-10-13 10:52:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:42,530 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2024-10-13 10:52:42,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2024-10-13 10:52:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:52:42,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:42,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:42,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:52:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:42,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:42,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1292102199, now seen corresponding path program 1 times [2024-10-13 10:52:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878020370] [2024-10-13 10:52:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878020370] [2024-10-13 10:52:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878020370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:52:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303659686] [2024-10-13 10:52:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:52:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:52:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:42,799 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:42,978 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2024-10-13 10:52:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:52:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-13 10:52:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:42,979 INFO L225 Difference]: With dead ends: 149 [2024-10-13 10:52:42,979 INFO L226 Difference]: Without dead ends: 149 [2024-10-13 10:52:42,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:42,980 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:42,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-13 10:52:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2024-10-13 10:52:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.6021505376344085) internal successors, (149), 117 states have internal predecessors, (149), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2024-10-13 10:52:42,988 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 28 [2024-10-13 10:52:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:42,988 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2024-10-13 10:52:42,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2024-10-13 10:52:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:52:42,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:42,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:42,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:52:42,989 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:42,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1292102198, now seen corresponding path program 1 times [2024-10-13 10:52:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537043252] [2024-10-13 10:52:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537043252] [2024-10-13 10:52:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537043252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741914174] [2024-10-13 10:52:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:43,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:43,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:43,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:52:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:43,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-13 10:52:43,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:43,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:43,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:52:43,413 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-13 10:52:43,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:43,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:52:43,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:43,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:43,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:52:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741914174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:52:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2024-10-13 10:52:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427406004] [2024-10-13 10:52:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:43,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:52:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:52:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:52:43,481 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:43,723 INFO L93 Difference]: Finished difference Result 148 states and 191 transitions. [2024-10-13 10:52:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:52:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-13 10:52:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:43,725 INFO L225 Difference]: With dead ends: 148 [2024-10-13 10:52:43,725 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 10:52:43,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:52:43,726 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:43,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 308 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 420 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2024-10-13 10:52:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 10:52:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2024-10-13 10:52:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 129 states have internal predecessors, (169), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2024-10-13 10:52:43,730 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 28 [2024-10-13 10:52:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2024-10-13 10:52:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2024-10-13 10:52:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:52:43,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:43,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:43,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:43,932 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463065, now seen corresponding path program 1 times [2024-10-13 10:52:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:43,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553886755] [2024-10-13 10:52:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553886755] [2024-10-13 10:52:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553886755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:52:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242431844] [2024-10-13 10:52:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:44,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:44,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:44,011 INFO L87 Difference]: Start difference. First operand 141 states and 187 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:44,133 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-10-13 10:52:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:44,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-13 10:52:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:44,135 INFO L225 Difference]: With dead ends: 162 [2024-10-13 10:52:44,135 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 10:52:44,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:44,135 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:44,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 417 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 10:52:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2024-10-13 10:52:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 106 states have (on average 1.5849056603773586) internal successors, (168), 130 states have internal predecessors, (168), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:52:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2024-10-13 10:52:44,139 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 29 [2024-10-13 10:52:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2024-10-13 10:52:44,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2024-10-13 10:52:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:52:44,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:44,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:44,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:52:44,140 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 906147695, now seen corresponding path program 1 times [2024-10-13 10:52:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800764558] [2024-10-13 10:52:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800764558] [2024-10-13 10:52:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800764558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097967295] [2024-10-13 10:52:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:44,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:44,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:44,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:52:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:44,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 10:52:44,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:44,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:52:44,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 10:52:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:44,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-10-13 10:52:44,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:44,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-10-13 10:52:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097967295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:44,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-13 10:52:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892850677] [2024-10-13 10:52:44,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:52:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:52:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:52:44,746 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:52:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:45,098 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2024-10-13 10:52:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:52:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-10-13 10:52:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:45,101 INFO L225 Difference]: With dead ends: 182 [2024-10-13 10:52:45,101 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 10:52:45,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:52:45,101 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:45,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 833 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 10:52:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2024-10-13 10:52:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 142 states have internal predecessors, (183), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2024-10-13 10:52:45,107 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 30 [2024-10-13 10:52:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:45,108 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2024-10-13 10:52:45,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:52:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-10-13 10:52:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:52:45,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:45,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:45,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 10:52:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 10:52:45,309 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:45,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 906147696, now seen corresponding path program 1 times [2024-10-13 10:52:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004058579] [2024-10-13 10:52:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:45,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:45,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004058579] [2024-10-13 10:52:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004058579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963023022] [2024-10-13 10:52:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:45,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:45,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:45,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:52:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:45,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:52:45,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:45,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:52:45,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:52:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 10:52:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:45,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:46,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2024-10-13 10:52:46,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2024-10-13 10:52:46,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:46,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:46,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:46,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2024-10-13 10:52:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963023022] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:46,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2024-10-13 10:52:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505537064] [2024-10-13 10:52:46,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:46,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:52:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:52:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:52:46,239 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:52:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:46,634 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2024-10-13 10:52:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:52:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2024-10-13 10:52:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:46,635 INFO L225 Difference]: With dead ends: 166 [2024-10-13 10:52:46,635 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 10:52:46,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:52:46,636 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:46,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1064 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 10:52:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2024-10-13 10:52:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5423728813559323) internal successors, (182), 142 states have internal predecessors, (182), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2024-10-13 10:52:46,639 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 30 [2024-10-13 10:52:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:46,640 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2024-10-13 10:52:46,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:52:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2024-10-13 10:52:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:52:46,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:46,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:46,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:52:46,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 10:52:46,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1114051057, now seen corresponding path program 1 times [2024-10-13 10:52:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674889192] [2024-10-13 10:52:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:52:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:52:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:47,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674889192] [2024-10-13 10:52:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674889192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:47,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:52:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631540116] [2024-10-13 10:52:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:52:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:52:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:52:47,067 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:52:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:47,290 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2024-10-13 10:52:47,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:52:47,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-13 10:52:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:47,291 INFO L225 Difference]: With dead ends: 170 [2024-10-13 10:52:47,291 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 10:52:47,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:47,292 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:47,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 379 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 10:52:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2024-10-13 10:52:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.5476190476190477) internal successors, (195), 150 states have internal predecessors, (195), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 215 transitions. [2024-10-13 10:52:47,298 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 215 transitions. Word has length 32 [2024-10-13 10:52:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:47,299 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 215 transitions. [2024-10-13 10:52:47,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:52:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 215 transitions. [2024-10-13 10:52:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:52:47,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:47,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:52:47,300 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1114051056, now seen corresponding path program 1 times [2024-10-13 10:52:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449308244] [2024-10-13 10:52:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:52:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:52:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449308244] [2024-10-13 10:52:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449308244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:52:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616058619] [2024-10-13 10:52:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:52:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:52:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:52:47,640 INFO L87 Difference]: Start difference. First operand 163 states and 215 transitions. Second operand has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:52:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:47,896 INFO L93 Difference]: Finished difference Result 165 states and 217 transitions. [2024-10-13 10:52:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:52:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-13 10:52:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:47,897 INFO L225 Difference]: With dead ends: 165 [2024-10-13 10:52:47,897 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 10:52:47,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:52:47,897 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:47,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 335 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 10:52:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-13 10:52:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 150 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2024-10-13 10:52:47,901 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 32 [2024-10-13 10:52:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2024-10-13 10:52:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:52:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2024-10-13 10:52:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:52:47,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:47,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:47,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:52:47,902 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:47,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1517497877, now seen corresponding path program 1 times [2024-10-13 10:52:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:47,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309003043] [2024-10-13 10:52:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:48,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:48,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309003043] [2024-10-13 10:52:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309003043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 10:52:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555614877] [2024-10-13 10:52:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:52:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:52:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:52:48,243 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:48,512 INFO L93 Difference]: Finished difference Result 174 states and 220 transitions. [2024-10-13 10:52:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:52:48,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-13 10:52:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:48,513 INFO L225 Difference]: With dead ends: 174 [2024-10-13 10:52:48,514 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 10:52:48,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:52:48,515 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:48,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 478 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 10:52:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-10-13 10:52:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 150 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2024-10-13 10:52:48,518 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 31 [2024-10-13 10:52:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:48,519 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2024-10-13 10:52:48,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2024-10-13 10:52:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:52:48,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:48,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:48,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:52:48,519 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:48,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1517497876, now seen corresponding path program 1 times [2024-10-13 10:52:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952200746] [2024-10-13 10:52:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952200746] [2024-10-13 10:52:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952200746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 10:52:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721341048] [2024-10-13 10:52:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:48,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:52:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:52:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:52:48,852 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:49,160 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2024-10-13 10:52:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:52:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-13 10:52:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:49,161 INFO L225 Difference]: With dead ends: 173 [2024-10-13 10:52:49,161 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 10:52:49,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:52:49,162 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:49,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 574 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 10:52:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-10-13 10:52:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.5078125) internal successors, (193), 151 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:52:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2024-10-13 10:52:49,166 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 31 [2024-10-13 10:52:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:49,166 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2024-10-13 10:52:49,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2024-10-13 10:52:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:52:49,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:49,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:49,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:52:49,167 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-13 10:52:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1070334003, now seen corresponding path program 1 times [2024-10-13 10:52:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805857767] [2024-10-13 10:52:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:52:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 10:52:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805857767] [2024-10-13 10:52:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805857767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102139267] [2024-10-13 10:52:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:49,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:49,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:49,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 10:52:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:49,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-13 10:52:49,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:49,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:49,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:49,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:50,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:50,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:52:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-13 10:52:50,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:52:50,203 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-13 10:52:50,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-10-13 10:52:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:50,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:50,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-13 10:53:01,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:53:01,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3119 treesize of output 2930