./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:24:13,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:24:13,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:24:13,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:24:13,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:24:13,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:24:13,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:24:13,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:24:13,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:24:13,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:24:13,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:24:13,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:24:13,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:24:13,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:24:13,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:24:13,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:24:13,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:24:13,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:24:13,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:24:13,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:24:13,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:24:13,355 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:24:13,356 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:24:13,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:24:13,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:24:13,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:24:13,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:24:13,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:24:13,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:24:13,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:24:13,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:24:13,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:24:13,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:24:13,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:24:13,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:24:13,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:24:13,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:24:13,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:24:13,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:24:13,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:24:13,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:24:13,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:24:13,364 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2024-11-10 15:24:13,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:24:13,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:24:13,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:24:13,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:24:13,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:24:13,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-11-10 15:24:15,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:24:15,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:24:15,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-11-10 15:24:15,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0637d2d0/dedab385f2704af489475fa2c95279a6/FLAG90cbb6c04 [2024-11-10 15:24:15,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0637d2d0/dedab385f2704af489475fa2c95279a6 [2024-11-10 15:24:15,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:24:15,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:24:15,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:24:15,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:24:15,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:24:15,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:15" (1/1) ... [2024-11-10 15:24:15,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d0d195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15, skipping insertion in model container [2024-11-10 15:24:15,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:15" (1/1) ... [2024-11-10 15:24:15,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:24:16,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:24:16,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:24:16,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:24:16,267 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:24:16,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16 WrapperNode [2024-11-10 15:24:16,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:24:16,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:24:16,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:24:16,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:24:16,274 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:24:16" (1/1) ... [2024-11-10 15:24:16,293 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:24:16" (1/1) ... [2024-11-10 15:24:16,315 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-11-10 15:24:16,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:24:16,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:24:16,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:24:16,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:24:16,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,352 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-10 15:24:16,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:24:16,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:24:16,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:24:16,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:24:16,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (1/1) ... [2024-11-10 15:24:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:24:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:16,415 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:24:16,417 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:24:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 15:24:16,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 15:24:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:24:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:24:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:24:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:24:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:24:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:24:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:24:16,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:24:16,569 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:24:16,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:24:17,061 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-10 15:24:17,061 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:24:17,083 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:24:17,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:24:17,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:17 BoogieIcfgContainer [2024-11-10 15:24:17,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:24:17,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:24:17,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:24:17,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:24:17,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:15" (1/3) ... [2024-11-10 15:24:17,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:17, skipping insertion in model container [2024-11-10 15:24:17,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:16" (2/3) ... [2024-11-10 15:24:17,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:17, skipping insertion in model container [2024-11-10 15:24:17,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:17" (3/3) ... [2024-11-10 15:24:17,093 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2024-11-10 15:24:17,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:24:17,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2024-11-10 15:24:17,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:24:17,151 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;@20713242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:24:17,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2024-11-10 15:24:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 108 states have (on average 1.9722222222222223) internal successors, (213), 182 states have internal predecessors, (213), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:24:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:24:17,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:17,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:24:17,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:17,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash 249210, now seen corresponding path program 1 times [2024-11-10 15:24:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552277978] [2024-11-10 15:24:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:17,388 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:24:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552277978] [2024-11-10 15:24:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552277978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132135712] [2024-11-10 15:24:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:17,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:17,437 INFO L87 Difference]: Start difference. First operand has 191 states, 108 states have (on average 1.9722222222222223) internal successors, (213), 182 states have internal predecessors, (213), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:17,694 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2024-11-10 15:24:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:24:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:17,708 INFO L225 Difference]: With dead ends: 212 [2024-11-10 15:24:17,708 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 15:24:17,710 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:24:17,713 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 152 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:17,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 135 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 15:24:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2024-11-10 15:24:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 103 states have (on average 1.825242718446602) internal successors, (188), 179 states have internal predecessors, (188), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2024-11-10 15:24:17,828 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 3 [2024-11-10 15:24:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:17,829 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2024-11-10 15:24:17,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2024-11-10 15:24:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:24:17,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:17,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:24:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:24:17,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash 249211, now seen corresponding path program 1 times [2024-11-10 15:24:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602554867] [2024-11-10 15:24:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:17,947 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:24:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602554867] [2024-11-10 15:24:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602554867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238405388] [2024-11-10 15:24:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:17,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:17,950 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:18,114 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-11-10 15:24:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:24:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:18,116 INFO L225 Difference]: With dead ends: 177 [2024-11-10 15:24:18,116 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 15:24:18,117 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:24:18,118 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 161 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:18,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 114 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 15:24:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-10 15:24:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 175 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2024-11-10 15:24:18,133 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 3 [2024-11-10 15:24:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:18,133 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2024-11-10 15:24:18,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2024-11-10 15:24:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:24:18,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:18,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:18,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:24:18,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:18,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1771904332, now seen corresponding path program 1 times [2024-11-10 15:24:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:18,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264850119] [2024-11-10 15:24:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:18,241 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:24:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264850119] [2024-11-10 15:24:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264850119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298786195] [2024-11-10 15:24:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:18,243 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:18,396 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2024-11-10 15:24:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:24:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:18,398 INFO L225 Difference]: With dead ends: 171 [2024-11-10 15:24:18,398 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 15:24:18,399 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:24:18,399 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:18,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 122 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 15:24:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-10 15:24:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.7115384615384615) internal successors, (178), 169 states have internal predecessors, (178), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2024-11-10 15:24:18,422 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 7 [2024-11-10 15:24:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2024-11-10 15:24:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2024-11-10 15:24:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:24:18,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:18,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:24:18,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1771904331, now seen corresponding path program 1 times [2024-11-10 15:24:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454117229] [2024-11-10 15:24:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:18,553 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:24:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454117229] [2024-11-10 15:24:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454117229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:18,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482574722] [2024-11-10 15:24:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:18,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:18,557 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:18,693 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2024-11-10 15:24:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:18,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:24:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:18,694 INFO L225 Difference]: With dead ends: 175 [2024-11-10 15:24:18,694 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 15:24:18,695 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:24:18,696 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:18,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 142 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 15:24:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-10 15:24:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.6396396396396395) internal successors, (182), 173 states have internal predecessors, (182), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2024-11-10 15:24:18,710 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 7 [2024-11-10 15:24:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:18,711 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2024-11-10 15:24:18,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2024-11-10 15:24:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:24:18,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:18,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:18,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:24:18,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:18,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:18,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1773653385, now seen corresponding path program 1 times [2024-11-10 15:24:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:18,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733927279] [2024-11-10 15:24:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:19,035 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:24:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733927279] [2024-11-10 15:24:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733927279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:19,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365058623] [2024-11-10 15:24:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:19,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:19,043 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:19,243 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2024-11-10 15:24:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:24:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:19,245 INFO L225 Difference]: With dead ends: 163 [2024-11-10 15:24:19,245 INFO L226 Difference]: Without dead ends: 163 [2024-11-10 15:24:19,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:19,251 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 173 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:19,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 113 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-10 15:24:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-10 15:24:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 161 states have internal predecessors, (172), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2024-11-10 15:24:19,262 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 13 [2024-11-10 15:24:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:19,263 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2024-11-10 15:24:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2024-11-10 15:24:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:24:19,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:19,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:19,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:24:19,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:19,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1773653386, now seen corresponding path program 1 times [2024-11-10 15:24:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403640398] [2024-11-10 15:24:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:19,477 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:24:19,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403640398] [2024-11-10 15:24:19,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403640398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:19,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:19,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:19,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118821227] [2024-11-10 15:24:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:19,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:24:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:19,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:24:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:19,484 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:19,774 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2024-11-10 15:24:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:24:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:19,776 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:24:19,776 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 15:24:19,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:19,777 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 264 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:19,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 212 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 15:24:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-10 15:24:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 125 states have (on average 1.48) internal successors, (185), 171 states have internal predecessors, (185), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2024-11-10 15:24:19,787 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 13 [2024-11-10 15:24:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:19,788 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2024-11-10 15:24:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2024-11-10 15:24:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:24:19,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:19,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:24:19,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:19,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2074491372, now seen corresponding path program 1 times [2024-11-10 15:24:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766726150] [2024-11-10 15:24:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:19,953 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:24:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766726150] [2024-11-10 15:24:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766726150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385422358] [2024-11-10 15:24:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:19,955 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:20,134 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2024-11-10 15:24:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 15:24:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:20,136 INFO L225 Difference]: With dead ends: 172 [2024-11-10 15:24:20,136 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 15:24:20,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:24:20,137 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:20,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 411 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 15:24:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-10 15:24:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 125 states have (on average 1.464) internal successors, (183), 170 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2024-11-10 15:24:20,149 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 16 [2024-11-10 15:24:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2024-11-10 15:24:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2024-11-10 15:24:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:24:20,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:20,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:24:20,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2074491371, now seen corresponding path program 1 times [2024-11-10 15:24:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172328744] [2024-11-10 15:24:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:20,384 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:24:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172328744] [2024-11-10 15:24:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172328744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:20,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670775082] [2024-11-10 15:24:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:20,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:20,387 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:20,573 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2024-11-10 15:24:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:20,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 15:24:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:20,575 INFO L225 Difference]: With dead ends: 171 [2024-11-10 15:24:20,575 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 15:24:20,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:24:20,576 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 2 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:20,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 413 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 15:24:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-10 15:24:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 125 states have (on average 1.448) internal successors, (181), 169 states have internal predecessors, (181), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2024-11-10 15:24:20,582 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 16 [2024-11-10 15:24:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:20,583 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2024-11-10 15:24:20,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2024-11-10 15:24:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:24:20,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:20,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:20,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:24:20,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -480154008, now seen corresponding path program 1 times [2024-11-10 15:24:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684515143] [2024-11-10 15:24:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:20,668 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:24:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:20,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684515143] [2024-11-10 15:24:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684515143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094217287] [2024-11-10 15:24:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:20,675 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:24:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:20,883 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2024-11-10 15:24:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2024-11-10 15:24:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:20,885 INFO L225 Difference]: With dead ends: 212 [2024-11-10 15:24:20,885 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 15:24:20,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:20,886 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 301 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:20,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 190 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 15:24:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2024-11-10 15:24:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 173 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2024-11-10 15:24:20,892 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 18 [2024-11-10 15:24:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:20,892 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2024-11-10 15:24:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:24:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2024-11-10 15:24:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:24:20,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:20,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:24:20,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:20,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1754763634, now seen corresponding path program 1 times [2024-11-10 15:24:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590509333] [2024-11-10 15:24:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:21,146 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:24:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590509333] [2024-11-10 15:24:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590509333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:24:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049108056] [2024-11-10 15:24:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:21,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:24:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:24:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:24:21,147 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:21,605 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2024-11-10 15:24:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 15:24:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:21,607 INFO L225 Difference]: With dead ends: 174 [2024-11-10 15:24:21,607 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 15:24:21,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:24:21,608 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 166 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:21,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 378 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 15:24:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-10 15:24:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 172 states have internal predecessors, (184), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2024-11-10 15:24:21,612 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 20 [2024-11-10 15:24:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:21,612 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2024-11-10 15:24:21,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2024-11-10 15:24:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:24:21,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:21,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:24:21,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1754763633, now seen corresponding path program 1 times [2024-11-10 15:24:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776931204] [2024-11-10 15:24:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:21,976 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:24:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776931204] [2024-11-10 15:24:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776931204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:21,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:21,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:24:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973881244] [2024-11-10 15:24:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:21,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:24:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:24:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:21,979 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:22,573 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2024-11-10 15:24:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:24:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 15:24:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:22,575 INFO L225 Difference]: With dead ends: 191 [2024-11-10 15:24:22,575 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 15:24:22,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:24:22,576 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 221 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:22,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 474 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 15:24:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2024-11-10 15:24:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.3617021276595744) internal successors, (192), 177 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 198 transitions. [2024-11-10 15:24:22,580 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 198 transitions. Word has length 20 [2024-11-10 15:24:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:22,581 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 198 transitions. [2024-11-10 15:24:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 198 transitions. [2024-11-10 15:24:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:24:22,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:22,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:22,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:24:22,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:22,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 234989929, now seen corresponding path program 1 times [2024-11-10 15:24:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488924530] [2024-11-10 15:24:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:22,853 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:24:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488924530] [2024-11-10 15:24:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488924530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:24:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136096584] [2024-11-10 15:24:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:22,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:24:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:24:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:22,856 INFO L87 Difference]: Start difference. First operand 179 states and 198 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:24:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:23,141 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2024-11-10 15:24:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:23,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2024-11-10 15:24:23,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:23,142 INFO L225 Difference]: With dead ends: 232 [2024-11-10 15:24:23,142 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 15:24:23,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:23,143 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 271 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:23,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 438 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 15:24:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 188. [2024-11-10 15:24:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 186 states have internal predecessors, (202), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2024-11-10 15:24:23,151 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 22 [2024-11-10 15:24:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2024-11-10 15:24:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:24:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2024-11-10 15:24:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:24:23,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:23,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:24:23,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:23,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1275065445, now seen corresponding path program 1 times [2024-11-10 15:24:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410892443] [2024-11-10 15:24:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:23,266 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:24:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410892443] [2024-11-10 15:24:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410892443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610929563] [2024-11-10 15:24:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:23,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:23,269 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:24:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:23,363 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2024-11-10 15:24:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 29 [2024-11-10 15:24:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:23,365 INFO L225 Difference]: With dead ends: 191 [2024-11-10 15:24:23,365 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 15:24:23,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:23,366 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 17 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:23,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 345 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 15:24:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-11-10 15:24:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 185 states have internal predecessors, (200), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2024-11-10 15:24:23,370 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 29 [2024-11-10 15:24:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:23,370 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2024-11-10 15:24:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:24:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2024-11-10 15:24:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:24:23,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:23,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:23,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:24:23,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -441696376, now seen corresponding path program 1 times [2024-11-10 15:24:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645405820] [2024-11-10 15:24:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:23,489 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:24:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645405820] [2024-11-10 15:24:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645405820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:23,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:23,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269483921] [2024-11-10 15:24:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:23,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:23,492 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:23,642 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2024-11-10 15:24:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:24:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:23,644 INFO L225 Difference]: With dead ends: 186 [2024-11-10 15:24:23,644 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 15:24:23,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:24:23,644 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:23,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 15:24:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-10 15:24:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 184 states have internal predecessors, (199), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2024-11-10 15:24:23,651 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 28 [2024-11-10 15:24:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:23,651 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2024-11-10 15:24:23,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2024-11-10 15:24:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:24:23,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:23,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:24:23,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:23,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -441696375, now seen corresponding path program 1 times [2024-11-10 15:24:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507722062] [2024-11-10 15:24:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:23,894 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:24:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507722062] [2024-11-10 15:24:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507722062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:23,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:23,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691524200] [2024-11-10 15:24:23,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:23,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:23,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:23,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:23,896 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:24,050 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2024-11-10 15:24:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:24:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:24,051 INFO L225 Difference]: With dead ends: 185 [2024-11-10 15:24:24,051 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 15:24:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:24:24,052 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:24,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 15:24:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-10 15:24:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.32) internal successors, (198), 183 states have internal predecessors, (198), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2024-11-10 15:24:24,056 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 28 [2024-11-10 15:24:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2024-11-10 15:24:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2024-11-10 15:24:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:24:24,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:24,058 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] [2024-11-10 15:24:24,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:24:24,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 335392759, now seen corresponding path program 1 times [2024-11-10 15:24:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638109738] [2024-11-10 15:24:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:24,343 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:24:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638109738] [2024-11-10 15:24:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638109738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371423476] [2024-11-10 15:24:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:24,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:24,348 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:24:24,350 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:24:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:24,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:24:24,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:24,568 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:24:24,576 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:24:24,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:24:24,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:24:24,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:24,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 15:24:24,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 15:24:25,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:24:25,053 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:24:25,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:25,434 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 10 treesize of output 8 [2024-11-10 15:24:25,440 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 14 treesize of output 12 [2024-11-10 15:24:25,450 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 10 treesize of output 8 [2024-11-10 15:24:25,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:25,466 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:24:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371423476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:25,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 16 [2024-11-10 15:24:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831770575] [2024-11-10 15:24:25,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:24:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:24:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:24:25,468 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:26,100 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2024-11-10 15:24:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:24:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 15:24:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:26,102 INFO L225 Difference]: With dead ends: 229 [2024-11-10 15:24:26,102 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 15:24:26,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:24:26,103 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 263 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:26,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 821 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:24:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 15:24:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 194. [2024-11-10 15:24:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 192 states have internal predecessors, (208), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2024-11-10 15:24:26,107 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 29 [2024-11-10 15:24:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:26,107 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2024-11-10 15:24:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2024-11-10 15:24:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:24:26,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:26,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:26,126 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:24:26,312 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,SelfDestructingSolverStorable15 [2024-11-10 15:24:26,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1968989537, now seen corresponding path program 1 times [2024-11-10 15:24:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420721997] [2024-11-10 15:24:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:26,375 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:24:26,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:26,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420721997] [2024-11-10 15:24:26,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420721997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:26,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:26,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:26,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748694849] [2024-11-10 15:24:26,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:26,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:26,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:26,378 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:24:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:26,521 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2024-11-10 15:24:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 31 [2024-11-10 15:24:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:26,522 INFO L225 Difference]: With dead ends: 197 [2024-11-10 15:24:26,523 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 15:24:26,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:24:26,523 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 20 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:26,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 399 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 15:24:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2024-11-10 15:24:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.2974683544303798) internal successors, (205), 191 states have internal predecessors, (205), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2024-11-10 15:24:26,527 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 31 [2024-11-10 15:24:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2024-11-10 15:24:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:24:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2024-11-10 15:24:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:24:26,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:26,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:26,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:24:26,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:26,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1006591716, now seen corresponding path program 1 times [2024-11-10 15:24:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100374394] [2024-11-10 15:24:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:26,705 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:24:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100374394] [2024-11-10 15:24:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100374394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084229753] [2024-11-10 15:24:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:26,709 INFO L87 Difference]: Start difference. First operand 193 states and 210 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:24:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:26,841 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2024-11-10 15:24:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:26,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 33 [2024-11-10 15:24:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:26,843 INFO L225 Difference]: With dead ends: 193 [2024-11-10 15:24:26,843 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 15:24:26,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:26,844 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:26,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 292 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 15:24:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2024-11-10 15:24:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 190 states have internal predecessors, (203), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2024-11-10 15:24:26,848 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 33 [2024-11-10 15:24:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:26,848 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2024-11-10 15:24:26,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:24:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2024-11-10 15:24:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:24:26,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:26,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:26,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:24:26,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:26,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1355954174, now seen corresponding path program 1 times [2024-11-10 15:24:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262588152] [2024-11-10 15:24:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:27,080 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:24:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262588152] [2024-11-10 15:24:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262588152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878244473] [2024-11-10 15:24:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:24:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:27,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:24:27,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:27,083 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:27,373 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2024-11-10 15:24:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:24:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:24:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:27,375 INFO L225 Difference]: With dead ends: 192 [2024-11-10 15:24:27,375 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 15:24:27,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:24:27,375 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:27,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 387 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 15:24:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2024-11-10 15:24:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 189 states have internal predecessors, (202), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2024-11-10 15:24:27,380 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 32 [2024-11-10 15:24:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2024-11-10 15:24:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2024-11-10 15:24:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:24:27,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:27,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:27,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:24:27,389 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1355954173, now seen corresponding path program 1 times [2024-11-10 15:24:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685003998] [2024-11-10 15:24:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:27,741 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:24:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685003998] [2024-11-10 15:24:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685003998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:24:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018332962] [2024-11-10 15:24:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:27,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:24:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:24:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:24:27,744 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:28,124 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2024-11-10 15:24:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:28,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:24:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:28,125 INFO L225 Difference]: With dead ends: 187 [2024-11-10 15:24:28,126 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 15:24:28,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:24:28,127 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:28,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 625 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 15:24:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2024-11-10 15:24:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 163 states have internal predecessors, (174), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-10 15:24:28,131 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 32 [2024-11-10 15:24:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-10 15:24:28,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-10 15:24:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:24:28,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:28,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:24:28,132 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2061140712, now seen corresponding path program 1 times [2024-11-10 15:24:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824000935] [2024-11-10 15:24:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:28,429 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:24:28,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824000935] [2024-11-10 15:24:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824000935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:28,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:24:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698480999] [2024-11-10 15:24:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:24:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:24:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:28,432 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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:24:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:28,879 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2024-11-10 15:24:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:24:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 36 [2024-11-10 15:24:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:28,881 INFO L225 Difference]: With dead ends: 221 [2024-11-10 15:24:28,881 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 15:24:28,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:24:28,882 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 357 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:28,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 390 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 15:24:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 175. [2024-11-10 15:24:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 173 states have internal predecessors, (184), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2024-11-10 15:24:28,886 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 36 [2024-11-10 15:24:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:28,887 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2024-11-10 15:24:28,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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:24:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2024-11-10 15:24:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:24:28,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:28,888 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] [2024-11-10 15:24:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:24:28,888 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1793449565, now seen corresponding path program 1 times [2024-11-10 15:24:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:28,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408140535] [2024-11-10 15:24:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:28,937 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:24:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408140535] [2024-11-10 15:24:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408140535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197552201] [2024-11-10 15:24:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:28,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:28,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:28,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:28,939 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:28,986 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2024-11-10 15:24:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:24:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:28,987 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:24:28,988 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 15:24:28,988 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:24:28,988 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 63 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:28,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 15:24:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-10 15:24:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 174 states have internal predecessors, (184), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2024-11-10 15:24:28,994 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 36 [2024-11-10 15:24:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:28,994 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2024-11-10 15:24:28,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2024-11-10 15:24:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:24:28,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:28,995 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, 1] [2024-11-10 15:24:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:24:28,995 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:28,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1703808267, now seen corresponding path program 1 times [2024-11-10 15:24:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115370251] [2024-11-10 15:24:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:29,122 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:24:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115370251] [2024-11-10 15:24:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115370251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480822396] [2024-11-10 15:24:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:29,125 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:24:29,127 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:24:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:29,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:24:29,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:29,259 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:24:29,313 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:24:29,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:24:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480822396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:29,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:24:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-10 15:24:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848464144] [2024-11-10 15:24:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:29,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:29,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:24:29,315 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:29,388 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2024-11-10 15:24:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 15:24:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:29,389 INFO L225 Difference]: With dead ends: 184 [2024-11-10 15:24:29,389 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 15:24:29,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:29,390 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:29,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 15:24:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2024-11-10 15:24:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 154 states have (on average 1.2207792207792207) internal successors, (188), 178 states have internal predecessors, (188), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2024-11-10 15:24:29,394 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 39 [2024-11-10 15:24:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2024-11-10 15:24:29,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2024-11-10 15:24:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:24:29,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:29,395 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] [2024-11-10 15:24:29,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:24:29,599 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,SelfDestructingSolverStorable22 [2024-11-10 15:24:29,600 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 258443931, now seen corresponding path program 1 times [2024-11-10 15:24:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:29,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166533190] [2024-11-10 15:24:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:29,795 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:24:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166533190] [2024-11-10 15:24:29,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166533190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700377250] [2024-11-10 15:24:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:29,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:29,798 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:24:29,800 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:24:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:29,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:24:29,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:29,954 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:24:30,001 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:24:30,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:24:30,049 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:24:30,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:24:30,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 15:24:30,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:30,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 16 [2024-11-10 15:24:30,567 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:24:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:30,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:30,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700377250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:30,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:30,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-11-10 15:24:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628994633] [2024-11-10 15:24:30,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:30,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:24:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:30,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:24:30,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:24:30,923 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:31,913 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2024-11-10 15:24:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:24:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 15:24:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:31,914 INFO L225 Difference]: With dead ends: 212 [2024-11-10 15:24:31,914 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 15:24:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 15:24:31,916 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 489 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:31,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 687 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:24:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 15:24:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2024-11-10 15:24:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 169 states have (on average 1.21301775147929) internal successors, (205), 193 states have internal predecessors, (205), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 209 transitions. [2024-11-10 15:24:31,920 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 209 transitions. Word has length 41 [2024-11-10 15:24:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:31,921 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 209 transitions. [2024-11-10 15:24:31,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 209 transitions. [2024-11-10 15:24:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:24:31,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:31,922 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] [2024-11-10 15:24:31,940 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:24:32,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:32,126 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -578174856, now seen corresponding path program 1 times [2024-11-10 15:24:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242618656] [2024-11-10 15:24:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:24:32,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242618656] [2024-11-10 15:24:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242618656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:32,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:32,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144910775] [2024-11-10 15:24:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:32,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:32,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:32,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:32,179 INFO L87 Difference]: Start difference. First operand 195 states and 209 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:32,217 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2024-11-10 15:24:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:32,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:24:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:32,221 INFO L225 Difference]: With dead ends: 194 [2024-11-10 15:24:32,221 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 15:24:32,222 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:24:32,222 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 82 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 105 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:32,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 105 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 15:24:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-10 15:24:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.2011834319526626) internal successors, (203), 192 states have internal predecessors, (203), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2024-11-10 15:24:32,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 42 [2024-11-10 15:24:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:32,230 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2024-11-10 15:24:32,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2024-11-10 15:24:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:24:32,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:32,231 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:24:32,231 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1953444490, now seen corresponding path program 1 times [2024-11-10 15:24:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550667536] [2024-11-10 15:24:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:32,890 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:24:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550667536] [2024-11-10 15:24:32,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550667536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613652740] [2024-11-10 15:24:32,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:32,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:32,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:32,892 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:24:32,894 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:24:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:33,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:24:33,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:33,059 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:24:33,087 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:24:33,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:24:33,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:24:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:33,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:24:33,236 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:24:33,327 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:24:33,328 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 41 treesize of output 38 [2024-11-10 15:24:33,335 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:24:33,362 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:24:33,409 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:24:33,436 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:24:33,520 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:24:33,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:33,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:24:33,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:24:33,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int))) (= 1 (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2024-11-10 15:24:33,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1441) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:24:33,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1441) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1442) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1444)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:24:33,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:33,649 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 33 treesize of output 34 [2024-11-10 15:24:33,654 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 60 treesize of output 52 [2024-11-10 15:24:33,659 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 24 treesize of output 22 [2024-11-10 15:24:33,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or (not .cse0) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440))))) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))) .cse0) (forall ((v_ArrVal_1440 (Array Int Int))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))))) is different from false [2024-11-10 15:24:37,676 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 97 treesize of output 95 [2024-11-10 15:24:37,684 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 69 treesize of output 57 [2024-11-10 15:24:37,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:37,702 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 3 [2024-11-10 15:24:37,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:37,708 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 24 treesize of output 22 [2024-11-10 15:24:37,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:37,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:37,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-10 15:24:37,749 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:24:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613652740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:37,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2024-11-10 15:24:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472180341] [2024-11-10 15:24:37,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:37,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:24:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:24:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=723, Unknown=10, NotChecked=366, Total=1260 [2024-11-10 15:24:37,752 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 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:24:38,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_9| Int)) (or (forall ((v_ArrVal_1440 (Array Int Int))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc4#1.base_9| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc4#1.base_9| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_9|) 0)))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (or (not .cse3) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440))))) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))) .cse3) (forall ((v_ArrVal_1440 (Array Int Int))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440))) (or (= (select (select (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1441) v_arrayElimCell_28 v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_9| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1440) |v_ULTIMATE.start_main_#t~malloc4#1.base_9| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1440 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1440)))) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_9|) 0)))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1))) is different from false [2024-11-10 15:24:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:39,434 INFO L93 Difference]: Finished difference Result 514 states and 559 transitions. [2024-11-10 15:24:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-10 15:24:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 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 46 [2024-11-10 15:24:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:39,436 INFO L225 Difference]: With dead ends: 514 [2024-11-10 15:24:39,436 INFO L226 Difference]: Without dead ends: 514 [2024-11-10 15:24:39,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=421, Invalid=1576, Unknown=11, NotChecked=644, Total=2652 [2024-11-10 15:24:39,437 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 780 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2595 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:39,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1599 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1687 Invalid, 0 Unknown, 2595 Unchecked, 1.1s Time] [2024-11-10 15:24:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-10 15:24:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 249. [2024-11-10 15:24:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 224 states have (on average 1.1696428571428572) internal successors, (262), 247 states have internal predecessors, (262), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 266 transitions. [2024-11-10 15:24:39,445 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 266 transitions. Word has length 46 [2024-11-10 15:24:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:39,445 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 266 transitions. [2024-11-10 15:24:39,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 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:24:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 266 transitions. [2024-11-10 15:24:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:24:39,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:39,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:39,465 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:24:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:24:39,651 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1778644925, now seen corresponding path program 1 times [2024-11-10 15:24:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943687788] [2024-11-10 15:24:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:40,257 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:24:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943687788] [2024-11-10 15:24:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943687788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:40,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 15:24:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626009121] [2024-11-10 15:24:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:40,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:24:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:24:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:24:40,260 INFO L87 Difference]: Start difference. First operand 249 states and 266 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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:24:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:41,028 INFO L93 Difference]: Finished difference Result 293 states and 311 transitions. [2024-11-10 15:24:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:24:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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 46 [2024-11-10 15:24:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:41,030 INFO L225 Difference]: With dead ends: 293 [2024-11-10 15:24:41,030 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 15:24:41,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:24:41,031 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 423 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:41,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 728 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:24:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 15:24:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 238. [2024-11-10 15:24:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 1.1728971962616823) internal successors, (251), 236 states have internal predecessors, (251), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 254 transitions. [2024-11-10 15:24:41,036 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 254 transitions. Word has length 46 [2024-11-10 15:24:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:41,036 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 254 transitions. [2024-11-10 15:24:41,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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:24:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 254 transitions. [2024-11-10 15:24:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:24:41,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:41,036 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, 1] [2024-11-10 15:24:41,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:24:41,037 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1992567915, now seen corresponding path program 1 times [2024-11-10 15:24:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623366672] [2024-11-10 15:24:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:41,338 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:24:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623366672] [2024-11-10 15:24:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623366672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834901025] [2024-11-10 15:24:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:41,341 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:24:41,343 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:24:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:41,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 15:24:41,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:41,526 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:24:41,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2024-11-10 15:24:41,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2024-11-10 15:24:41,790 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:24:41,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:42,077 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:24:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834901025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:42,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-10 15:24:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847984339] [2024-11-10 15:24:42,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:24:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:24:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:24:42,080 INFO L87 Difference]: Start difference. First operand 238 states and 254 transitions. Second operand has 14 states, 13 states have (on average 8.76923076923077) internal successors, (114), 14 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:42,485 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2024-11-10 15:24:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:42,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.76923076923077) internal successors, (114), 14 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 15:24:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:42,486 INFO L225 Difference]: With dead ends: 252 [2024-11-10 15:24:42,486 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 15:24:42,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:24:42,487 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:42,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 604 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 15:24:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-10 15:24:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 194 states have (on average 1.1855670103092784) internal successors, (230), 216 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2024-11-10 15:24:42,491 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 46 [2024-11-10 15:24:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:42,491 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2024-11-10 15:24:42,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.76923076923077) internal successors, (114), 14 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2024-11-10 15:24:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:24:42,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:42,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:42,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:24:42,692 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,SelfDestructingSolverStorable27 [2024-11-10 15:24:42,692 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -129150134, now seen corresponding path program 1 times [2024-11-10 15:24:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511768722] [2024-11-10 15:24:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511768722] [2024-11-10 15:24:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511768722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749845438] [2024-11-10 15:24:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:43,139 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:24:43,140 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:24:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:43,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 15:24:43,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:43,321 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:24:43,352 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:24:43,353 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:24:43,390 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:24:43,467 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:24:43,467 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:24:43,533 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:24:43,533 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 33 treesize of output 24 [2024-11-10 15:24:43,557 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:24:43,557 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:24:43,697 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:24:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:43,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:43,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1762)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2024-11-10 15:24:43,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:43,928 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 38 treesize of output 31 [2024-11-10 15:24:43,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:43,939 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 144 treesize of output 131 [2024-11-10 15:24:43,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:43,951 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 80 treesize of output 78 [2024-11-10 15:24:43,955 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 70 treesize of output 66 [2024-11-10 15:24:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749845438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:45,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 31 [2024-11-10 15:24:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362343400] [2024-11-10 15:24:45,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:24:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:24:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=736, Unknown=49, NotChecked=58, Total=992 [2024-11-10 15:24:45,092 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:46,113 INFO L93 Difference]: Finished difference Result 315 states and 340 transitions. [2024-11-10 15:24:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:24:46,114 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-10 15:24:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:46,115 INFO L225 Difference]: With dead ends: 315 [2024-11-10 15:24:46,115 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 15:24:46,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1188, Unknown=56, NotChecked=74, Total=1560 [2024-11-10 15:24:46,116 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 490 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:46,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 688 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1204 Invalid, 0 Unknown, 268 Unchecked, 0.8s Time] [2024-11-10 15:24:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 15:24:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 235. [2024-11-10 15:24:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 211 states have (on average 1.180094786729858) internal successors, (249), 233 states have internal predecessors, (249), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 252 transitions. [2024-11-10 15:24:46,120 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 252 transitions. Word has length 53 [2024-11-10 15:24:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:46,120 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 252 transitions. [2024-11-10 15:24:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 252 transitions. [2024-11-10 15:24:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:24:46,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:46,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:46,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:24:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 15:24:46,326 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:24:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -129150133, now seen corresponding path program 1 times [2024-11-10 15:24:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534523864] [2024-11-10 15:24:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534523864] [2024-11-10 15:24:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534523864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479273630] [2024-11-10 15:24:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:47,008 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:24:47,009 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:24:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:24:47,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:47,197 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:24:47,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:24:47,273 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:24:47,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-10 15:24:47,312 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:24:47,316 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:24:47,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:24:47,401 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 50 treesize of output 45 [2024-11-10 15:24:47,406 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:24:47,515 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-10 15:24:47,516 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 19 treesize of output 18 [2024-11-10 15:24:47,530 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:24:47,531 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 33 treesize of output 24 [2024-11-10 15:24:47,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:24:47,619 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 72 treesize of output 63 [2024-11-10 15:24:47,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-10 15:24:47,940 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 36 treesize of output 20 [2024-11-10 15:24:47,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:24:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:47,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:49,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,008 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 136 treesize of output 120 [2024-11-10 15:24:49,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,018 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 102 treesize of output 78 [2024-11-10 15:24:49,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,038 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 612 treesize of output 543 [2024-11-10 15:24:49,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 559 [2024-11-10 15:24:49,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,101 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 173 treesize of output 167 [2024-11-10 15:24:49,164 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-10 15:24:49,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 154 treesize of output 186 [2024-11-10 15:24:49,182 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 108 treesize of output 102 [2024-11-10 15:24:49,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:49,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-10 15:24:49,655 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 19 treesize of output 15 [2024-11-10 15:24:50,140 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-10 15:24:50,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 306 treesize of output 322 [2024-11-10 15:24:51,073 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-10 15:24:51,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 213 treesize of output 229 [2024-11-10 15:24:51,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:51,889 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 40 treesize of output 44 [2024-11-10 15:24:51,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:51,950 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 220 treesize of output 218 [2024-11-10 15:24:52,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:52,384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 85 [2024-11-10 15:24:52,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:52,395 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2024-11-10 15:24:52,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:52,401 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 53 treesize of output 41 [2024-11-10 15:24:52,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:52,417 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2024-11-10 15:24:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 32 [2024-11-10 15:24:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:53,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:53,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 390 treesize of output 983 [2024-11-10 15:24:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479273630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:59,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2024-11-10 15:24:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124726686] [2024-11-10 15:24:59,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:59,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 15:24:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 15:24:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1292, Unknown=18, NotChecked=0, Total=1482 [2024-11-10 15:24:59,735 INFO L87 Difference]: Start difference. First operand 235 states and 252 transitions. Second operand has 39 states, 38 states have (on average 3.9210526315789473) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:25:01,998 INFO L93 Difference]: Finished difference Result 288 states and 311 transitions. [2024-11-10 15:25:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:25:01,999 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.9210526315789473) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-10 15:25:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:25:02,000 INFO L225 Difference]: With dead ends: 288 [2024-11-10 15:25:02,000 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 15:25:02,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=498, Invalid=2906, Unknown=18, NotChecked=0, Total=3422 [2024-11-10 15:25:02,002 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 651 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:25:02,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1141 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 15:25:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 15:25:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 238. [2024-11-10 15:25:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 1.1775700934579438) internal successors, (252), 236 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 255 transitions. [2024-11-10 15:25:02,007 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 255 transitions. Word has length 53 [2024-11-10 15:25:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:25:02,007 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 255 transitions. [2024-11-10 15:25:02,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.9210526315789473) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 255 transitions. [2024-11-10 15:25:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:25:02,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:25:02,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:25:02,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:25:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:25:02,209 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2024-11-10 15:25:02,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:25:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 945790689, now seen corresponding path program 1 times [2024-11-10 15:25:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:25:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870627696] [2024-11-10 15:25:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:25:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:25:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:25:03,371 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:25:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:25:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870627696] [2024-11-10 15:25:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870627696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:25:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518197930] [2024-11-10 15:25:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:25:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:25:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:25:03,374 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:25:03,375 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:25:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:25:03,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 15:25:03,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:25:03,572 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:25:03,590 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:25:03,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:25:03,636 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:25:03,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:25:03,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:25:03,675 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:25:03,751 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:25:03,752 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 41 treesize of output 38 [2024-11-10 15:25:03,755 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:25:03,772 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:25:03,816 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:25:03,852 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:25:03,875 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:25:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:25:03,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:25:03,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:25:03,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:25:03,974 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-10 15:25:03,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:25:03,993 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 24 treesize of output 12 [2024-11-10 15:25:04,031 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:25:04,037 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:25:04,091 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:25:04,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:25:04,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:25:04,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2099 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_2099) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2102)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-10 15:25:04,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:25:04,253 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 33 treesize of output 34 [2024-11-10 15:25:04,256 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 60 treesize of output 52 [2024-11-10 15:25:04,260 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 24 treesize of output 22 [2024-11-10 15:25:04,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2097))) (or (forall ((v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2099) v_arrayElimCell_114 v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2097 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2099) v_arrayElimCell_114 v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not .cse2)) (or (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) .cse2))) is different from false [2024-11-10 15:25:08,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:25:08,231 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 168 treesize of output 137 [2024-11-10 15:25:08,237 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 257 treesize of output 233 [2024-11-10 15:25:08,246 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 219 treesize of output 213 [2024-11-10 15:25:08,392 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-10 15:25:08,392 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 220 treesize of output 330 [2024-11-10 15:25:08,436 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 230 treesize of output 218 [2024-11-10 15:25:22,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse7 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (.cse4 (not .cse5)) (.cse10 (forall ((v_ArrVal_2092 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092))))) (.cse28 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse42 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse42 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))))) (and (or (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116)))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (= (select (select (store (store .cse3 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse3 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116))))))))) .cse4) (or .cse5 (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_123 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) .cse7)) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35) (forall ((v_arrayElimCell_116 Int)) (or (forall ((v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse9 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int)) (= (select (select (store (store .cse9 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= v_prenex_35 v_arrayElimCell_116))))))) (or (and .cse10 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_123 Int)) (or (= v_arrayElimCell_123 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (forall ((v_ArrVal_2093 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|)))))) .cse5) (or .cse5 (forall ((v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or .cse4 (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_116 Int)) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= v_prenex_35 v_arrayElimCell_116))))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (forall ((v_arrayElimCell_116 Int)) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (= (select (select (store (store .cse13 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse13 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= v_prenex_35 v_arrayElimCell_116))) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_116 Int)) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse16 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int)) (= (select (select (store (store .cse16 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= v_prenex_35 v_arrayElimCell_116) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_116))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse17 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse17 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_116))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))) (or .cse4 (forall ((v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse19 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse19 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116))))) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse21 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse21 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))) (or .cse4 (forall ((v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116)))))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse24 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse24 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116))))))))) .cse4) (or (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_123 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123) (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) .cse7) .cse5) (or .cse4 (forall ((v_ArrVal_2092 (Array Int Int)) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse26 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse26 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116)))))) (or .cse5 (and .cse28 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (forall ((v_arrayElimCell_116 Int)) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse30 (store .cse29 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse30 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int)) (= (select (select (store (store .cse30 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_116))) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35))))))) (or .cse4 (and (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (forall ((v_arrayElimCell_116 Int)) (or (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (= (select (select (store (store .cse31 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse31 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= v_prenex_35 v_arrayElimCell_116))) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (forall ((v_arrayElimCell_116 Int)) (or (forall ((v_prenex_36 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= v_prenex_35 v_arrayElimCell_116))) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse4 (forall ((v_ArrVal_2092 (Array Int Int)) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse33 (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse33 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse33 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_35 v_arrayElimCell_116)))))) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2102 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2097 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123) (= (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (or (and .cse10 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_123 Int)) (or (= v_arrayElimCell_123 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (or (forall ((v_ArrVal_2093 (Array Int Int))) (= (select (select (store (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2093) v_arrayElimCell_123 v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2097) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2102) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_123)))))))) .cse5) (or (and .cse28 (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_arrayElimCell_116 Int) (v_prenex_37 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse37 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse37 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_116))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35)))))) .cse5) (or (forall ((v_ArrVal_2092 (Array Int Int)) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int) (v_prenex_37 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (= (select (select (store (store .cse39 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store .cse39 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35)))) .cse5) (forall ((v_ArrVal_2092 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2092 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2092)) (forall ((v_prenex_35 Int)) (or (= v_prenex_35 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_116 Int)) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2092))) (let ((.cse41 (store .cse40 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_37))) (or (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_34) v_arrayElimCell_116 v_prenex_37) v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse41 v_prenex_35 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2099 (Array Int Int)) (v_arrayElimCell_114 Int)) (= (select (select (store (store .cse41 v_prenex_35 v_ArrVal_2099) v_arrayElimCell_114 v_prenex_36) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= v_prenex_35 v_arrayElimCell_116))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_35)))))))) is different from false