./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/memsafety-broom/sll-fst-shared.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 b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:21:18,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:21:18,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:21:18,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:21:18,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:21:18,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:21:18,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:21:18,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:21:18,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:21:18,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:21:18,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:21:18,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:21:18,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:21:18,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:21:18,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:21:18,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:21:18,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:21:18,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:21:18,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:21:18,223 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:21:18,224 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:21:18,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:21:18,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:21:18,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:21:18,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:21:18,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:21:18,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:21:18,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:21:18,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:21:18,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:21:18,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:18,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:21:18,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:21:18,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:21:18,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:21:18,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:21:18,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:21:18,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:21:18,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:21:18,232 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 -> b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 [2024-11-10 15:21:18,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:21:18,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:21:18,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:21:18,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:21:18,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:21:18,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2024-11-10 15:21:19,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:21:20,118 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:21:20,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2024-11-10 15:21:20,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47b8cefc/30e24c5d4aad40ff8cac44ef45b3d9f7/FLAG5cf40e76e [2024-11-10 15:21:20,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47b8cefc/30e24c5d4aad40ff8cac44ef45b3d9f7 [2024-11-10 15:21:20,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:21:20,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:21:20,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:20,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:21:20,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:21:20,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1d1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20, skipping insertion in model container [2024-11-10 15:21:20,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:21:20,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:20,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:21:20,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:20,597 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:21:20,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20 WrapperNode [2024-11-10 15:21:20,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:20,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:20,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:21:20,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:21:20,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,646 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 71 [2024-11-10 15:21:20,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:20,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:21:20,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:21:20,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:21:20,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,682 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-11-10 15:21:20,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:21:20,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:21:20,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:21:20,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:21:20,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (1/1) ... [2024-11-10 15:21:20,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:20,758 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-11-10 15:21:20,763 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-11-10 15:21:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:21:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:21:20,816 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:21:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:21:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:21:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:21:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:21:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:21:20,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:21:20,954 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:21:20,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:21:21,260 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-10 15:21:21,262 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:21:21,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:21:21,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:21:21,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:21 BoogieIcfgContainer [2024-11-10 15:21:21,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:21:21,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:21:21,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:21:21,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:21:21,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:20" (1/3) ... [2024-11-10 15:21:21,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc8720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:21, skipping insertion in model container [2024-11-10 15:21:21,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:20" (2/3) ... [2024-11-10 15:21:21,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc8720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:21, skipping insertion in model container [2024-11-10 15:21:21,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:21" (3/3) ... [2024-11-10 15:21:21,300 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-fst-shared.i [2024-11-10 15:21:21,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:21:21,318 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-10 15:21:21,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:21:21,380 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;@6698636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:21:21,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-10 15:21:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.75) internal successors, (84), 77 states have internal predecessors, (84), 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-11-10 15:21:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:21,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:21,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:21,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 110670808, now seen corresponding path program 1 times [2024-11-10 15:21:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572615135] [2024-11-10 15:21:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572615135] [2024-11-10 15:21:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572615135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:21,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:21,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709694077] [2024-11-10 15:21:21,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:21,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:21,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:21,655 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.75) internal successors, (84), 77 states have internal predecessors, (84), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-10 15:21:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:21,786 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-10 15:21:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:21,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-10 15:21:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:21,795 INFO L225 Difference]: With dead ends: 80 [2024-11-10 15:21:21,795 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 15:21:21,797 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-11-10 15:21:21,800 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:21,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 15:21:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-10 15:21:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.673913043478261) internal successors, (77), 73 states have internal predecessors, (77), 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-11-10 15:21:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-10 15:21:21,845 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 5 [2024-11-10 15:21:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:21,846 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-10 15:21:21,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-10 15:21:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-10 15:21:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:21,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:21,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:21,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:21:21,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:21,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash 110670809, now seen corresponding path program 1 times [2024-11-10 15:21:21,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:21,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473036523] [2024-11-10 15:21:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473036523] [2024-11-10 15:21:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473036523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247989948] [2024-11-10 15:21:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:22,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:22,003 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-10 15:21:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:22,064 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-10 15:21:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-10 15:21:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:22,066 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:21:22,066 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:21:22,066 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-11-10 15:21:22,067 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:22,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:21:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 15:21:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 72 states have internal predecessors, (76), 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-11-10 15:21:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-10 15:21:22,079 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 5 [2024-11-10 15:21:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:22,079 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-10 15:21:22,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-10 15:21:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-10 15:21:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:22,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:22,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:22,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:21:22,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:22,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 985972829, now seen corresponding path program 1 times [2024-11-10 15:21:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393942831] [2024-11-10 15:21:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393942831] [2024-11-10 15:21:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393942831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:22,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:22,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644645917] [2024-11-10 15:21:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:22,222 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:22,336 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-10 15:21:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-10 15:21:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:22,339 INFO L225 Difference]: With dead ends: 80 [2024-11-10 15:21:22,339 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 15:21:22,340 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-11-10 15:21:22,343 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:22,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 15:21:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-10 15:21:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 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-11-10 15:21:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-10 15:21:22,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 10 [2024-11-10 15:21:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:22,358 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-10 15:21:22,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-10 15:21:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:22,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:22,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:22,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:21:22,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:22,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash 985972830, now seen corresponding path program 1 times [2024-11-10 15:21:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898918259] [2024-11-10 15:21:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898918259] [2024-11-10 15:21:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898918259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625654577] [2024-11-10 15:21:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:22,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:22,505 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:22,595 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-10 15:21:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-10 15:21:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:22,596 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:21:22,597 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:21:22,598 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-11-10 15:21:22,599 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:22,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 160 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:21:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-10 15:21:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.608695652173913) internal successors, (74), 70 states have internal predecessors, (74), 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-11-10 15:21:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-10 15:21:22,611 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 10 [2024-11-10 15:21:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:22,612 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-10 15:21:22,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-10 15:21:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:21:22,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:22,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:22,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:21:22,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1667882182, now seen corresponding path program 1 times [2024-11-10 15:21:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575175974] [2024-11-10 15:21:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:22,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575175974] [2024-11-10 15:21:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575175974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293872021] [2024-11-10 15:21:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:22,831 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:22,998 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-10 15:21:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:21:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:23,000 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:21:23,000 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:21:23,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:23,002 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:23,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 279 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:21:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-10 15:21:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 67 states have internal predecessors, (71), 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-11-10 15:21:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-10 15:21:23,011 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2024-11-10 15:21:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:23,011 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-10 15:21:23,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-10 15:21:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:21:23,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:23,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:23,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:21:23,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:23,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1667882181, now seen corresponding path program 1 times [2024-11-10 15:21:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128711574] [2024-11-10 15:21:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128711574] [2024-11-10 15:21:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128711574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:23,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:23,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415195754] [2024-11-10 15:21:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:23,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:23,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:23,406 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:23,549 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-10 15:21:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:23,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:21:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:23,552 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:21:23,552 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 15:21:23,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:23,554 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:23,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 260 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 15:21:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2024-11-10 15:21:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 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-11-10 15:21:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-10 15:21:23,565 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 12 [2024-11-10 15:21:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:23,565 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-10 15:21:23,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-10 15:21:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:21:23,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:23,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:23,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:21:23,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -512134596, now seen corresponding path program 1 times [2024-11-10 15:21:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441475140] [2024-11-10 15:21:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:23,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441475140] [2024-11-10 15:21:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441475140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740343660] [2024-11-10 15:21:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:23,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:23,817 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:24,007 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-11-10 15:21:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-10 15:21:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:24,009 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:21:24,011 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:21:24,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:21:24,012 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:24,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 421 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:21:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-10 15:21:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5) internal successors, (84), 76 states have internal predecessors, (84), 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-11-10 15:21:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-11-10 15:21:24,020 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 19 [2024-11-10 15:21:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:24,020 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-11-10 15:21:24,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-11-10 15:21:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:21:24,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:24,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:24,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:21:24,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:24,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash -512134597, now seen corresponding path program 1 times [2024-11-10 15:21:24,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:24,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776122508] [2024-11-10 15:21:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776122508] [2024-11-10 15:21:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776122508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:24,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:24,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:21:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367680302] [2024-11-10 15:21:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:24,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:24,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:24,127 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:24,263 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-10 15:21:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:24,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-10 15:21:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:24,265 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:21:24,265 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:21:24,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-10 15:21:24,266 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:24,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 245 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:21:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-10 15:21:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 89 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2024-11-10 15:21:24,277 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 19 [2024-11-10 15:21:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2024-11-10 15:21:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2024-11-10 15:21:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:21:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:24,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:21:24,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:24,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1275020526, now seen corresponding path program 1 times [2024-11-10 15:21:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097757063] [2024-11-10 15:21:24,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:24,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097757063] [2024-11-10 15:21:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097757063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:24,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:21:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490979196] [2024-11-10 15:21:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:24,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:21:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:21:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:21:24,458 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-10 15:21:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:24,546 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2024-11-10 15:21:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:21:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2024-11-10 15:21:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:24,547 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:21:24,547 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:21:24,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:21:24,548 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:24,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:21:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 15:21:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 89 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2024-11-10 15:21:24,559 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 21 [2024-11-10 15:21:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2024-11-10 15:21:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-10 15:21:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2024-11-10 15:21:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:21:24,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:24,561 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:24,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:21:24,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1275020527, now seen corresponding path program 1 times [2024-11-10 15:21:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850027297] [2024-11-10 15:21:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850027297] [2024-11-10 15:21:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850027297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342387826] [2024-11-10 15:21:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:24,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:24,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:24,874 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-11-10 15:21:24,875 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-11-10 15:21:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:24,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:21:24,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:25,199 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:21:25,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:25,262 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 16 treesize of output 11 [2024-11-10 15:21:25,278 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:25,279 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-11-10 15:21:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:21:25,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342387826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:25,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-10 15:21:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188493732] [2024-11-10 15:21:25,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:25,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:21:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:21:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2024-11-10 15:21:25,452 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 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-11-10 15:21:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:25,677 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-10 15:21:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 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 21 [2024-11-10 15:21:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:25,679 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:21:25,679 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:21:25,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=389, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:21:25,680 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:25,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 483 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2024-11-10 15:21:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:21:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-10 15:21:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-10 15:21:25,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 21 [2024-11-10 15:21:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-10 15:21:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 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-11-10 15:21:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-10 15:21:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:21:25,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:25,690 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] [2024-11-10 15:21:25,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:21:25,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:21:25,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1759855026, now seen corresponding path program 1 times [2024-11-10 15:21:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921528547] [2024-11-10 15:21:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:26,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:26,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921528547] [2024-11-10 15:21:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921528547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:26,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:26,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:26,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267533053] [2024-11-10 15:21:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:26,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:26,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:26,025 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:26,119 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-10 15:21:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 15:21:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:26,120 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:21:26,120 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:21:26,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-11-10 15:21:26,121 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:26,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:21:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-10 15:21:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-10 15:21:26,125 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 21 [2024-11-10 15:21:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:26,125 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-10 15:21:26,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-10 15:21:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:21:26,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:26,126 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] [2024-11-10 15:21:26,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:21:26,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:26,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash -554239116, now seen corresponding path program 1 times [2024-11-10 15:21:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946819445] [2024-11-10 15:21:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:26,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:26,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946819445] [2024-11-10 15:21:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946819445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:26,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179764181] [2024-11-10 15:21:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:26,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:26,260 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:26,393 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-10 15:21:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-10 15:21:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:26,394 INFO L225 Difference]: With dead ends: 95 [2024-11-10 15:21:26,394 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 15:21:26,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:26,395 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:26,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 15:21:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 15:21:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-10 15:21:26,398 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 24 [2024-11-10 15:21:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:26,398 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-10 15:21:26,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-10 15:21:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:21:26,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:26,399 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] [2024-11-10 15:21:26,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:21:26,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash -554239115, now seen corresponding path program 1 times [2024-11-10 15:21:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157444649] [2024-11-10 15:21:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157444649] [2024-11-10 15:21:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157444649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138240243] [2024-11-10 15:21:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:26,639 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:26,766 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-10 15:21:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:26,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-10 15:21:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:26,767 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:21:26,767 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:21:26,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:26,768 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:26,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 323 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:21:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 15:21:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-11-10 15:21:26,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 24 [2024-11-10 15:21:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:26,771 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-11-10 15:21:26,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-10 15:21:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:21:26,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:26,772 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 15:21:26,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:21:26,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:26,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1656170887, now seen corresponding path program 1 times [2024-11-10 15:21:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518836964] [2024-11-10 15:21:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:27,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518836964] [2024-11-10 15:21:27,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518836964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:27,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472597930] [2024-11-10 15:21:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:27,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:27,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:27,263 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-11-10 15:21:27,265 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-11-10 15:21:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 15:21:27,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:27,373 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-11-10 15:21:27,406 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-11-10 15:21:27,416 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-11-10 15:21:27,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:27,525 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-11-10 15:21:27,572 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 16 treesize of output 11 [2024-11-10 15:21:27,581 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 16 treesize of output 11 [2024-11-10 15:21:27,650 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-10 15:21:27,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 17 [2024-11-10 15:21:27,671 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-10 15:21:27,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 17 [2024-11-10 15:21:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:27,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:28,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_466 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_466))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))) (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_465))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 v_ArrVal_468))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))))) is different from false [2024-11-10 15:21:28,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:28,827 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-10 15:21:28,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:28,837 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 30 treesize of output 30 [2024-11-10 15:21:28,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-11-10 15:21:28,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:28,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-10 15:21:28,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:21:28,900 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:21:28,900 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 16 treesize of output 11 [2024-11-10 15:21:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:28,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472597930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:28,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:28,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2024-11-10 15:21:28,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840052743] [2024-11-10 15:21:28,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:21:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:28,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:21:28,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=787, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:21:28,960 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:29,600 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-10 15:21:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-10 15:21:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:29,601 INFO L225 Difference]: With dead ends: 97 [2024-11-10 15:21:29,601 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 15:21:29,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=1010, Unknown=1, NotChecked=64, Total=1190 [2024-11-10 15:21:29,602 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:29,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1048 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 545 Invalid, 0 Unknown, 41 Unchecked, 0.4s Time] [2024-11-10 15:21:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 15:21:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 15:21:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.32) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-10 15:21:29,606 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 26 [2024-11-10 15:21:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:29,606 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-10 15:21:29,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-10 15:21:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:21:29,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:29,607 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, 1, 1] [2024-11-10 15:21:29,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:21:29,811 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,SelfDestructingSolverStorable13 [2024-11-10 15:21:29,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1852607151, now seen corresponding path program 1 times [2024-11-10 15:21:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66291116] [2024-11-10 15:21:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66291116] [2024-11-10 15:21:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66291116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835188550] [2024-11-10 15:21:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:29,914 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:30,071 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2024-11-10 15:21:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-10 15:21:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:30,073 INFO L225 Difference]: With dead ends: 113 [2024-11-10 15:21:30,073 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 15:21:30,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:30,074 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 36 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:30,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 227 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 15:21:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-10 15:21:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-10 15:21:30,077 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 28 [2024-11-10 15:21:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:30,078 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-10 15:21:30,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-10 15:21:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:21:30,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:30,079 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, 1, 1] [2024-11-10 15:21:30,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:21:30,079 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:30,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1852607152, now seen corresponding path program 1 times [2024-11-10 15:21:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144968503] [2024-11-10 15:21:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144968503] [2024-11-10 15:21:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144968503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587427216] [2024-11-10 15:21:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:30,326 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-11-10 15:21:30,327 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-11-10 15:21:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:21:30,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:30,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:30,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:30,651 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 21 treesize of output 25 [2024-11-10 15:21:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587427216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:30,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2024-11-10 15:21:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234545465] [2024-11-10 15:21:30,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:21:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:21:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:21:30,723 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,080 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2024-11-10 15:21:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:21:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-10 15:21:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,081 INFO L225 Difference]: With dead ends: 138 [2024-11-10 15:21:31,081 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 15:21:31,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:21:31,082 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 71 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 543 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:21:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 15:21:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-11-10 15:21:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 118 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2024-11-10 15:21:31,089 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 28 [2024-11-10 15:21:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2024-11-10 15:21:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2024-11-10 15:21:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:21:31,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,090 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, 1, 1, 1] [2024-11-10 15:21:31,112 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-11-10 15:21:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:31,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1596246835, now seen corresponding path program 1 times [2024-11-10 15:21:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617345924] [2024-11-10 15:21:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617345924] [2024-11-10 15:21:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617345924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:21:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008661312] [2024-11-10 15:21:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:21:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:21:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:21:31,563 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,758 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-11-10 15:21:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-10 15:21:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,759 INFO L225 Difference]: With dead ends: 133 [2024-11-10 15:21:31,759 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 15:21:31,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:21:31,760 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 449 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 15:21:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2024-11-10 15:21:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 118 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2024-11-10 15:21:31,764 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 29 [2024-11-10 15:21:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,764 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2024-11-10 15:21:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2024-11-10 15:21:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:31,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,765 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, 1, 1, 1, 1] [2024-11-10 15:21:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:21:31,766 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2055955667, now seen corresponding path program 1 times [2024-11-10 15:21:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364225561] [2024-11-10 15:21:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364225561] [2024-11-10 15:21:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364225561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:21:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192010267] [2024-11-10 15:21:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:21:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:21:32,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:21:32,114 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,391 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2024-11-10 15:21:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:32,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-10 15:21:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,392 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:21:32,392 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:21:32,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:21:32,393 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 391 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:21:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-10 15:21:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 118 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2024-11-10 15:21:32,397 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 30 [2024-11-10 15:21:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,397 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2024-11-10 15:21:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2024-11-10 15:21:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:21:32,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,398 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, 1, 1, 1, 1, 1] [2024-11-10 15:21:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:21:32,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 689883761, now seen corresponding path program 1 times [2024-11-10 15:21:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292375914] [2024-11-10 15:21:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292375914] [2024-11-10 15:21:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292375914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:21:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666817059] [2024-11-10 15:21:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:32,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:21:32,698 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,933 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2024-11-10 15:21:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-10 15:21:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,934 INFO L225 Difference]: With dead ends: 128 [2024-11-10 15:21:32,934 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 15:21:32,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:21:32,935 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 401 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 15:21:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-10 15:21:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 118 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2024-11-10 15:21:32,939 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 31 [2024-11-10 15:21:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2024-11-10 15:21:32,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2024-11-10 15:21:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:21:32,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,940 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:21:32,940 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -68409417, now seen corresponding path program 1 times [2024-11-10 15:21:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143739014] [2024-11-10 15:21:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:33,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143739014] [2024-11-10 15:21:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143739014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:21:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524994355] [2024-11-10 15:21:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:33,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:33,059 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:33,162 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2024-11-10 15:21:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-10 15:21:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:33,164 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:21:33,164 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:21:33,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:33,165 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:33,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 398 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:21:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-11-10 15:21:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.27) internal successors, (127), 115 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2024-11-10 15:21:33,168 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 32 [2024-11-10 15:21:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2024-11-10 15:21:33,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2024-11-10 15:21:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:21:33,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:33,169 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, 1, 1] [2024-11-10 15:21:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:21:33,169 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash 129272461, now seen corresponding path program 1 times [2024-11-10 15:21:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376164506] [2024-11-10 15:21:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376164506] [2024-11-10 15:21:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376164506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342642766] [2024-11-10 15:21:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:33,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:33,604 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-11-10 15:21:33,605 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-11-10 15:21:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:21:33,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:33,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:33,920 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-11-10 15:21:33,930 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 16 treesize of output 11 [2024-11-10 15:21:33,965 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-11-10 15:21:34,016 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 8 treesize of output 4 [2024-11-10 15:21:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:34,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342642766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:34,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-10 15:21:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014563413] [2024-11-10 15:21:34,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:34,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:21:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:21:34,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:21:34,329 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 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-11-10 15:21:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:34,646 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2024-11-10 15:21:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 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 34 [2024-11-10 15:21:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:34,647 INFO L225 Difference]: With dead ends: 124 [2024-11-10 15:21:34,648 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 15:21:34,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 15:21:34,649 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:34,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 695 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 15:21:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-10 15:21:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2024-11-10 15:21:34,654 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 34 [2024-11-10 15:21:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2024-11-10 15:21:34,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 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-11-10 15:21:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2024-11-10 15:21:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:21:34,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:34,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:34,672 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-11-10 15:21:34,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:34,859 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:34,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash -808088321, now seen corresponding path program 1 times [2024-11-10 15:21:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784182122] [2024-11-10 15:21:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:21:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:21:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784182122] [2024-11-10 15:21:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784182122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206814292] [2024-11-10 15:21:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:35,225 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-11-10 15:21:35,226 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-11-10 15:21:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:21:35,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:35,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:35,398 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-11-10 15:21:35,416 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-11-10 15:21:35,463 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:21:35,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:21:35,473 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 25 treesize of output 13 [2024-11-10 15:21:35,489 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-10 15:21:35,516 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:21:35,516 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 19 treesize of output 16 [2024-11-10 15:21:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:21:35,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206814292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:35,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:35,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2024-11-10 15:21:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911088583] [2024-11-10 15:21:35,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:35,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:21:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:21:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=331, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:21:35,567 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:21:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:35,834 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-11-10 15:21:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-11-10 15:21:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:35,835 INFO L225 Difference]: With dead ends: 122 [2024-11-10 15:21:35,835 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 15:21:35,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2024-11-10 15:21:35,836 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:35,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 480 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2024-11-10 15:21:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 15:21:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 15:21:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-10 15:21:35,842 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 36 [2024-11-10 15:21:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:35,843 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-10 15:21:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:21:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-10 15:21:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:21:35,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:35,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:35,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:21:36,048 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,SelfDestructingSolverStorable21 [2024-11-10 15:21:36,049 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -808088320, now seen corresponding path program 1 times [2024-11-10 15:21:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063347179] [2024-11-10 15:21:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:21:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:21:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:36,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063347179] [2024-11-10 15:21:36,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063347179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:36,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966754316] [2024-11-10 15:21:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:36,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:36,536 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-11-10 15:21:36,537 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-11-10 15:21:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:21:36,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:36,699 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-11-10 15:21:36,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:36,765 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-11-10 15:21:36,792 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-11-10 15:21:36,798 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-11-10 15:21:36,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:21:36,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-10 15:21:36,883 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 24 treesize of output 11 [2024-11-10 15:21:36,928 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 18 [2024-11-10 15:21:36,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-10 15:21:37,027 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:21:37,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:37,045 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-11-10 15:21:37,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:37,053 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-11-10 15:21:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:21:37,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966754316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:37,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:37,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-10 15:21:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597152594] [2024-11-10 15:21:37,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:37,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:21:37,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:37,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:21:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-11-10 15:21:37,184 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:21:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:37,698 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-11-10 15:21:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:21:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-10 15:21:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:37,699 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:37,699 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:37,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=1236, Unknown=1, NotChecked=72, Total=1482 [2024-11-10 15:21:37,700 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:37,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 669 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 419 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2024-11-10 15:21:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 15:21:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-11-10 15:21:37,704 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 36 [2024-11-10 15:21:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:37,704 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-11-10 15:21:37,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:21:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-11-10 15:21:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:21:37,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:37,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:37,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:21:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:37,910 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1897875125, now seen corresponding path program 1 times [2024-11-10 15:21:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678740840] [2024-11-10 15:21:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678740840] [2024-11-10 15:21:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678740840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 15:21:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397141393] [2024-11-10 15:21:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:38,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:21:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:21:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:21:38,310 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:38,581 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2024-11-10 15:21:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-10 15:21:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:38,582 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:38,582 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:38,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:21:38,583 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 337 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 15:21:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.203883495145631) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2024-11-10 15:21:38,586 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 35 [2024-11-10 15:21:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:38,587 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2024-11-10 15:21:38,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2024-11-10 15:21:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:21:38,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:38,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:38,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:21:38,588 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:38,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -648375320, now seen corresponding path program 1 times [2024-11-10 15:21:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:38,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097691121] [2024-11-10 15:21:38,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097691121] [2024-11-10 15:21:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097691121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:38,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131150760] [2024-11-10 15:21:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:38,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:38,711 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:38,840 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-10 15:21:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:38,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-10 15:21:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:38,841 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:21:38,841 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:21:38,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:38,842 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:38,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 335 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:21:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-10 15:21:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-10 15:21:38,845 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 38 [2024-11-10 15:21:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:38,845 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-10 15:21:38,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-10 15:21:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:21:38,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:38,846 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2024-11-10 15:21:38,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:21:38,847 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:38,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash 153219336, now seen corresponding path program 1 times [2024-11-10 15:21:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:38,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108540128] [2024-11-10 15:21:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108540128] [2024-11-10 15:21:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108540128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247066363] [2024-11-10 15:21:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:39,359 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-11-10 15:21:39,361 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-11-10 15:21:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:39,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 15:21:39,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:39,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:39,610 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-11-10 15:21:39,656 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-11-10 15:21:39,659 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-11-10 15:21:39,727 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:21:39,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2024-11-10 15:21:39,733 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 39 treesize of output 24 [2024-11-10 15:21:39,883 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 31 treesize of output 19 [2024-11-10 15:21:39,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2024-11-10 15:21:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:39,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:40,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:40,139 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 42 treesize of output 46 [2024-11-10 15:21:40,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) 8))) (forall ((v_prenex_4 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_4) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 1))) (forall ((v_ArrVal_1210 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1210) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|))))) is different from false [2024-11-10 15:21:40,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:40,266 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-10 15:21:40,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:40,275 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 83 treesize of output 74 [2024-11-10 15:21:40,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:40,281 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 60 [2024-11-10 15:21:40,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 49 [2024-11-10 15:21:40,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:40,301 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 70 treesize of output 73 [2024-11-10 15:21:40,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 55 [2024-11-10 15:21:40,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 53 [2024-11-10 15:21:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247066363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:40,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-11-10 15:21:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875497231] [2024-11-10 15:21:40,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:40,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:21:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:40,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:21:40,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1067, Unknown=20, NotChecked=66, Total=1260 [2024-11-10 15:21:40,468 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:21:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:40,972 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2024-11-10 15:21:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:21:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-10 15:21:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:40,973 INFO L225 Difference]: With dead ends: 130 [2024-11-10 15:21:40,973 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 15:21:40,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1393, Unknown=20, NotChecked=76, Total=1640 [2024-11-10 15:21:40,975 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:40,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1006 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:21:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 15:21:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-10 15:21:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 124 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2024-11-10 15:21:40,980 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 41 [2024-11-10 15:21:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2024-11-10 15:21:40,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:21:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2024-11-10 15:21:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:21:40,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:40,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2024-11-10 15:21:40,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:21:41,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:41,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 153219335, now seen corresponding path program 1 times [2024-11-10 15:21:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211638661] [2024-11-10 15:21:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211638661] [2024-11-10 15:21:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211638661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057055291] [2024-11-10 15:21:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:41,559 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-11-10 15:21:41,560 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-11-10 15:21:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 15:21:41,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:41,800 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:21:41,800 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-11-10 15:21:41,839 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-11-10 15:21:41,923 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:21:41,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:21:42,055 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 25 treesize of output 13 [2024-11-10 15:21:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:42,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:42,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1314) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)) 1)) is different from false [2024-11-10 15:21:42,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) v_ArrVal_1314) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)) 1)) is different from false [2024-11-10 15:21:42,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:42,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-10 15:21:42,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:42,177 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 34 treesize of output 37 [2024-11-10 15:21:42,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-10 15:21:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057055291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:46,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2024-11-10 15:21:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861236845] [2024-11-10 15:21:46,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:46,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:21:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:21:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=776, Unknown=3, NotChecked=114, Total=992 [2024-11-10 15:21:46,352 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:21:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:46,696 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2024-11-10 15:21:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:21:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-10 15:21:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:46,697 INFO L225 Difference]: With dead ends: 130 [2024-11-10 15:21:46,697 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 15:21:46,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=824, Unknown=3, NotChecked=118, Total=1056 [2024-11-10 15:21:46,698 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:46,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 588 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:21:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 15:21:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-10 15:21:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 124 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-10 15:21:46,702 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 41 [2024-11-10 15:21:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-10 15:21:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:21:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2024-11-10 15:21:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:21:46,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:46,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:46,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 15:21:46,908 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1379257168, now seen corresponding path program 1 times [2024-11-10 15:21:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889327651] [2024-11-10 15:21:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889327651] [2024-11-10 15:21:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889327651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305416763] [2024-11-10 15:21:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:47,126 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-11-10 15:21:47,128 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-11-10 15:21:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:21:47,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:47,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:47,469 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 15 treesize of output 15 [2024-11-10 15:21:47,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:47,476 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 15 treesize of output 15 [2024-11-10 15:21:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:47,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:47,750 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-10 15:21:47,751 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 24 treesize of output 23 [2024-11-10 15:21:47,763 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-10 15:21:47,764 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 20 treesize of output 12 [2024-11-10 15:21:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305416763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:47,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 28 [2024-11-10 15:21:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429827932] [2024-11-10 15:21:47,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:47,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:21:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:47,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:21:47,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:21:47,909 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:48,501 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2024-11-10 15:21:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:21:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-10 15:21:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:48,502 INFO L225 Difference]: With dead ends: 164 [2024-11-10 15:21:48,502 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 15:21:48,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 15:21:48,503 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 37 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:48,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 757 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:21:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 15:21:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-10 15:21:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 151 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2024-11-10 15:21:48,507 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 43 [2024-11-10 15:21:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2024-11-10 15:21:48,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2024-11-10 15:21:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:21:48,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:48,508 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:48,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:21:48,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 15:21:48,709 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash -994151868, now seen corresponding path program 1 times [2024-11-10 15:21:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541231189] [2024-11-10 15:21:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541231189] [2024-11-10 15:21:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541231189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:49,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357069424] [2024-11-10 15:21:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:49,078 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-11-10 15:21:49,080 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-11-10 15:21:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:21:49,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:49,270 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-11-10 15:21:49,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:49,374 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-11-10 15:21:49,378 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 18 treesize of output 13 [2024-11-10 15:21:49,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:49,411 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 25 treesize of output 13 [2024-11-10 15:21:49,420 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-11-10 15:21:49,468 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 16 treesize of output 8 [2024-11-10 15:21:49,498 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 18 treesize of output 13 [2024-11-10 15:21:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:49,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:49,665 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1477) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0)) is different from false [2024-11-10 15:21:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357069424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:49,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:49,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-11-10 15:21:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997670249] [2024-11-10 15:21:49,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:21:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:21:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=940, Unknown=31, NotChecked=62, Total=1122 [2024-11-10 15:21:49,915 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:50,410 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2024-11-10 15:21:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:21:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-11-10 15:21:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:50,411 INFO L225 Difference]: With dead ends: 168 [2024-11-10 15:21:50,411 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 15:21:50,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1866, Unknown=32, NotChecked=88, Total=2162 [2024-11-10 15:21:50,413 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:50,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 835 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:21:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 15:21:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2024-11-10 15:21:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 149 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2024-11-10 15:21:50,421 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 44 [2024-11-10 15:21:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2024-11-10 15:21:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-11-10 15:21:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:21:50,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:50,421 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:50,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:21:50,622 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,SelfDestructingSolverStorable28 [2024-11-10 15:21:50,622 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:50,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1678795130, now seen corresponding path program 1 times [2024-11-10 15:21:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006164197] [2024-11-10 15:21:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006164197] [2024-11-10 15:21:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006164197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001162305] [2024-11-10 15:21:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:51,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:51,224 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-11-10 15:21:51,226 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-11-10 15:21:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:51,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 15:21:51,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:51,567 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-11-10 15:21:51,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,720 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 40 treesize of output 30 [2024-11-10 15:21:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:52,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:52,677 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 88 treesize of output 80 [2024-11-10 15:21:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001162305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2024-11-10 15:21:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914452555] [2024-11-10 15:21:53,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:21:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:21:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:21:53,125 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 25 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:53,942 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2024-11-10 15:21:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:21:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 25 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-10 15:21:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:53,943 INFO L225 Difference]: With dead ends: 162 [2024-11-10 15:21:53,943 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 15:21:53,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 15:21:53,944 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:53,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 515 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:21:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 15:21:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-10 15:21:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 126 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-11-10 15:21:53,947 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 45 [2024-11-10 15:21:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:53,948 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-11-10 15:21:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 25 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-11-10 15:21:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:21:53,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:53,948 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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-11-10 15:21:53,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:54,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:54,149 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2024-11-10 15:21:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1540990419, now seen corresponding path program 2 times [2024-11-10 15:21:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70597616] [2024-11-10 15:21:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:21:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70597616] [2024-11-10 15:21:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70597616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56713412] [2024-11-10 15:21:54,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:21:54,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:54,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:54,919 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-11-10 15:21:54,920 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-11-10 15:21:55,073 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:21:55,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:21:55,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-10 15:21:55,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:55,116 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-11-10 15:21:55,139 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-11-10 15:21:55,143 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-11-10 15:21:55,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:55,215 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-11-10 15:21:55,254 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 27 treesize of output 15 [2024-11-10 15:21:55,261 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 27 treesize of output 15 [2024-11-10 15:21:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:55,377 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-10 15:21:55,377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 71 [2024-11-10 15:21:55,397 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2024-11-10 15:21:55,398 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 1 case distinctions, treesize of input 57 treesize of output 28 [2024-11-10 15:21:55,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:21:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:55,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:57,846 INFO L349 Elim1Store]: treesize reduction 231, result has 54.1 percent of original size [2024-11-10 15:21:57,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 2953 treesize of output 1933 [2024-11-10 15:21:58,436 INFO L349 Elim1Store]: treesize reduction 10, result has 96.2 percent of original size [2024-11-10 15:21:58,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 4040 treesize of output 4157 [2024-11-10 15:21:59,175 INFO L349 Elim1Store]: treesize reduction 398, result has 53.2 percent of original size [2024-11-10 15:21:59,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 3860 treesize of output 3642 [2024-11-10 15:21:59,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:59,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4334 treesize of output 4466 [2024-11-10 15:22:00,529 INFO L349 Elim1Store]: treesize reduction 44, result has 85.1 percent of original size [2024-11-10 15:22:00,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3241 treesize of output 3399