./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-token-1.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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:58:35,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:58:35,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:58:35,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:58:35,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:58:35,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:58:35,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:58:35,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:58:35,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:58:35,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:58:35,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:58:35,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:58:35,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:58:35,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:58:35,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:58:35,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:58:35,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:58:35,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:58:35,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:58:35,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:58:35,739 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:58:35,739 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:58:35,739 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:58:35,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:58:35,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:58:35,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:58:35,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:58:35,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:58:35,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:58:35,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:58:35,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:58:35,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:58:35,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:58:35,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:58:35,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:58:35,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:58:35,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:58:35,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:58:35,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:58:35,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:58:35,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:58:35,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:58:35,745 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2024-11-09 07:58:35,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:58:36,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:58:36,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:58:36,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:58:36,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:58:36,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-09 07:58:37,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:58:37,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:58:37,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-09 07:58:37,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e881c7d4/831c74f8a12940859d5f4a2fa370ae29/FLAG7d7fe1f41 [2024-11-09 07:58:37,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e881c7d4/831c74f8a12940859d5f4a2fa370ae29 [2024-11-09 07:58:37,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:58:37,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:58:37,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:58:37,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:58:37,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:58:37,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:58:37" (1/1) ... [2024-11-09 07:58:37,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4f4219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:37, skipping insertion in model container [2024-11-09 07:58:37,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:58:37" (1/1) ... [2024-11-09 07:58:37,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:58:38,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:58:38,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:58:38,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:58:38,368 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:58:38,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38 WrapperNode [2024-11-09 07:58:38,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:58:38,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:58:38,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:58:38,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:58:38,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,421 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-11-09 07:58:38,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:58:38,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:58:38,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:58:38,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:58:38,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,454 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-09 07:58:38,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:58:38,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:58:38,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:58:38,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:58:38,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (1/1) ... [2024-11-09 07:58:38,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:58:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:38,521 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-09 07:58:38,523 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-09 07:58:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:58:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:58:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:58:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:58:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:58:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:58:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:58:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:58:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:58:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:58:38,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:58:38,711 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:58:38,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:58:39,116 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-09 07:58:39,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:58:39,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:58:39,142 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-09 07:58:39,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:58:39 BoogieIcfgContainer [2024-11-09 07:58:39,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:58:39,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:58:39,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:58:39,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:58:39,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:58:37" (1/3) ... [2024-11-09 07:58:39,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f108b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:58:39, skipping insertion in model container [2024-11-09 07:58:39,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:38" (2/3) ... [2024-11-09 07:58:39,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f108b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:58:39, skipping insertion in model container [2024-11-09 07:58:39,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:58:39" (3/3) ... [2024-11-09 07:58:39,154 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2024-11-09 07:58:39,170 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:58:39,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-09 07:58:39,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:58:39,231 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;@4620d64e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:58:39,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-09 07:58:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.135135135135135) internal successors, (158), 133 states have internal predecessors, (158), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:58:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:58:39,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:39,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:58:39,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-09 07:58:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617896754] [2024-11-09 07:58:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:39,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:39,456 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-09 07:58:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617896754] [2024-11-09 07:58:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617896754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:58:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682907831] [2024-11-09 07:58:39,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:39,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:39,495 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.135135135135135) internal successors, (158), 133 states have internal predecessors, (158), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 07:58:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:39,674 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2024-11-09 07:58:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:39,677 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-09 07:58:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:39,687 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:58:39,687 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:58:39,689 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-09 07:58:39,695 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 82 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:39,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 115 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:58:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 07:58:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 126 states have internal predecessors, (129), 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-09 07:58:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2024-11-09 07:58:39,803 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2024-11-09 07:58:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2024-11-09 07:58:39,803 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-09 07:58:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-11-09 07:58:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:58:39,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:39,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:58:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:58:39,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-09 07:58:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667517050] [2024-11-09 07:58:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:39,937 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-09 07:58:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667517050] [2024-11-09 07:58:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667517050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:39,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:58:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434655216] [2024-11-09 07:58:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:39,942 INFO L87 Difference]: Start difference. First operand 128 states and 135 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-09 07:58:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:40,066 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-09 07:58:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:40,068 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-09 07:58:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:40,069 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:58:40,070 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:58:40,070 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-09 07:58:40,071 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 82 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:40,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 115 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:58:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:58:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 123 states have internal predecessors, (126), 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-09 07:58:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-09 07:58:40,085 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 3 [2024-11-09 07:58:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-09 07:58:40,088 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-09 07:58:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-09 07:58:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:58:40,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:40,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:40,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:58:40,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash 919164508, now seen corresponding path program 1 times [2024-11-09 07:58:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:40,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099321375] [2024-11-09 07:58:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:40,227 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-09 07:58:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099321375] [2024-11-09 07:58:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099321375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323420268] [2024-11-09 07:58:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:40,232 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-09 07:58:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:40,407 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-09 07:58:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 07:58:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:40,409 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:58:40,409 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:58:40,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 07:58:40,410 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 124 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:40,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 77 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:58:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:58:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 110 states have internal predecessors, (115), 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-09 07:58:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-09 07:58:40,418 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 9 [2024-11-09 07:58:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:40,418 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-09 07:58:40,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-09 07:58:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-09 07:58:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:58:40,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:40,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:58:40,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 919164509, now seen corresponding path program 1 times [2024-11-09 07:58:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127926179] [2024-11-09 07:58:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:40,564 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-09 07:58:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127926179] [2024-11-09 07:58:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127926179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454123621] [2024-11-09 07:58:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:40,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:40,570 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-09 07:58:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:40,781 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-09 07:58:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 07:58:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:40,783 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:58:40,785 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 07:58:40,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 07:58:40,787 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:40,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 124 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 07:58:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-09 07:58:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 147 states have internal predecessors, (163), 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-09 07:58:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-09 07:58:40,801 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 9 [2024-11-09 07:58:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:40,802 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-09 07:58:40,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-09 07:58:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-09 07:58:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:58:40,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:40,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:40,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:58:40,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:40,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-09 07:58:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67052302] [2024-11-09 07:58:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:40,970 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-09 07:58:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67052302] [2024-11-09 07:58:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67052302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913756378] [2024-11-09 07:58:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:40,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:40,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:40,973 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 07:58:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:41,111 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-09 07:58:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-09 07:58:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:41,113 INFO L225 Difference]: With dead ends: 148 [2024-11-09 07:58:41,113 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 07:58:41,113 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-09 07:58:41,114 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:41,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 291 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 07:58:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-09 07:58:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.5333333333333334) internal successors, (161), 146 states have internal predecessors, (161), 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-09 07:58:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-09 07:58:41,121 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 12 [2024-11-09 07:58:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:41,121 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-09 07:58:41,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 07:58:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2024-11-09 07:58:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:58:41,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:41,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:58:41,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-09 07:58:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75821591] [2024-11-09 07:58:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:41,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:41,278 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-09 07:58:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75821591] [2024-11-09 07:58:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75821591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397276089] [2024-11-09 07:58:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:41,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:41,281 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 07:58:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:41,432 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-09 07:58:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-09 07:58:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:41,434 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:58:41,434 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:58:41,434 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-09 07:58:41,435 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:41,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:58:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 07:58:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.5142857142857142) internal successors, (159), 145 states have internal predecessors, (159), 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-09 07:58:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-11-09 07:58:41,446 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 12 [2024-11-09 07:58:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:41,446 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-11-09 07:58:41,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 07:58:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-11-09 07:58:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:58:41,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:41,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:41,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:58:41,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash -14975914, now seen corresponding path program 1 times [2024-11-09 07:58:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197308789] [2024-11-09 07:58:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:41,554 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-09 07:58:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197308789] [2024-11-09 07:58:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197308789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:41,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008507171] [2024-11-09 07:58:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:41,557 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 07:58:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:41,701 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2024-11-09 07:58:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-11-09 07:58:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:41,703 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:58:41,703 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 07:58:41,703 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-09 07:58:41,705 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:41,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 07:58:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-09 07:58:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 144 states have internal predecessors, (157), 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-09 07:58:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2024-11-09 07:58:41,722 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 14 [2024-11-09 07:58:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:41,723 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2024-11-09 07:58:41,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 07:58:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2024-11-09 07:58:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:58:41,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:41,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:41,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:58:41,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:41,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash -14975913, now seen corresponding path program 1 times [2024-11-09 07:58:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:41,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918017319] [2024-11-09 07:58:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:41,912 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-09 07:58:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918017319] [2024-11-09 07:58:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918017319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:41,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:41,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130668596] [2024-11-09 07:58:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:41,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:41,916 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 07:58:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:42,065 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2024-11-09 07:58:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-11-09 07:58:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:42,066 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:58:42,066 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:58:42,067 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-09 07:58:42,067 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:42,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:58:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-09 07:58:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 143 states have internal predecessors, (155), 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-09 07:58:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-11-09 07:58:42,073 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 14 [2024-11-09 07:58:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-11-09 07:58:42,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 07:58:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-11-09 07:58:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:58:42,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:42,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:42,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:58:42,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-09 07:58:42,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776523154] [2024-11-09 07:58:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:42,311 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-09 07:58:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776523154] [2024-11-09 07:58:42,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776523154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:42,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:42,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:58:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313110678] [2024-11-09 07:58:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:58:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:58:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:58:42,313 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-09 07:58:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:42,642 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-09 07:58:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:58:42,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-09 07:58:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:42,643 INFO L225 Difference]: With dead ends: 144 [2024-11-09 07:58:42,643 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 07:58:42,644 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-09 07:58:42,644 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 118 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:42,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 212 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 07:58:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 07:58:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 142 states have internal predecessors, (154), 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-09 07:58:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-09 07:58:42,649 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 16 [2024-11-09 07:58:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:42,649 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-09 07:58:42,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-09 07:58:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-09 07:58:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:58:42,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:42,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:42,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:58:42,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-09 07:58:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765365396] [2024-11-09 07:58:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:42,971 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-09 07:58:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765365396] [2024-11-09 07:58:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765365396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:58:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762285916] [2024-11-09 07:58:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:42,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:58:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:58:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:58:42,974 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-09 07:58:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:43,456 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2024-11-09 07:58:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:58:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-09 07:58:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:43,457 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:58:43,458 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:58:43,458 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-09 07:58:43,459 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 126 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:43,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 294 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:58:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2024-11-09 07:58:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.449438202247191) internal successors, (129), 118 states have internal predecessors, (129), 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-09 07:58:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2024-11-09 07:58:43,464 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 16 [2024-11-09 07:58:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2024-11-09 07:58:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-09 07:58:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2024-11-09 07:58:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:58:43,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:43,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:43,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:58:43,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:43,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 529199460, now seen corresponding path program 1 times [2024-11-09 07:58:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:43,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636069094] [2024-11-09 07:58:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:43,636 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-09 07:58:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636069094] [2024-11-09 07:58:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636069094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860980287] [2024-11-09 07:58:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:58:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:58:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:43,641 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-09 07:58:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:43,884 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2024-11-09 07:58:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:58:43,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2024-11-09 07:58:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:43,886 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:58:43,886 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:58:43,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-09 07:58:43,887 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 245 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:58:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-09 07:58:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 117 states have internal predecessors, (128), 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-09 07:58:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-11-09 07:58:43,890 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 17 [2024-11-09 07:58:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-11-09 07:58:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-09 07:58:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-11-09 07:58:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:58:43,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:43,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:58:43,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:43,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 529199461, now seen corresponding path program 1 times [2024-11-09 07:58:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205386372] [2024-11-09 07:58:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,177 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-09 07:58:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205386372] [2024-11-09 07:58:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205386372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536251795] [2024-11-09 07:58:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:58:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:58:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:44,180 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-09 07:58:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,449 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-11-09 07:58:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:58:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2024-11-09 07:58:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,450 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:58:44,450 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:58:44,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-09 07:58:44,451 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 316 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:58:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-09 07:58:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 116 states have internal predecessors, (127), 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-09 07:58:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-09 07:58:44,457 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 17 [2024-11-09 07:58:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,457 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-09 07:58:44,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-09 07:58:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-09 07:58:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:58:44,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,459 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-09 07:58:44,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:58:44,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:44,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2028654876, now seen corresponding path program 1 times [2024-11-09 07:58:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557210262] [2024-11-09 07:58:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,572 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-09 07:58:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557210262] [2024-11-09 07:58:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557210262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366005284] [2024-11-09 07:58:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:58:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:58:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:44,575 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-09 07:58:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,723 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-09 07:58:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:58:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2024-11-09 07:58:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,724 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:58:44,724 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:58:44,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:44,725 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 144 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:58:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-09 07:58:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 115 states have internal predecessors, (126), 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-09 07:58:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-09 07:58:44,729 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 20 [2024-11-09 07:58:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-09 07:58:44,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-09 07:58:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-09 07:58:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:58:44,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,730 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-09 07:58:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:58:44,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:44,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -187413698, now seen corresponding path program 1 times [2024-11-09 07:58:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085261113] [2024-11-09 07:58:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,783 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-09 07:58:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085261113] [2024-11-09 07:58:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085261113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938519877] [2024-11-09 07:58:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:44,787 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-09 07:58:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,887 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2024-11-09 07:58:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:44,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-09 07:58:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,888 INFO L225 Difference]: With dead ends: 142 [2024-11-09 07:58:44,888 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 07:58:44,889 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-09 07:58:44,893 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 109 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 137 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 07:58:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-09 07:58:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.404494382022472) internal successors, (125), 114 states have internal predecessors, (125), 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-09 07:58:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2024-11-09 07:58:44,897 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2024-11-09 07:58:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2024-11-09 07:58:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-09 07:58:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2024-11-09 07:58:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:58:44,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,903 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] [2024-11-09 07:58:44,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:58:44,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash -555182524, now seen corresponding path program 1 times [2024-11-09 07:58:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584990383] [2024-11-09 07:58:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,973 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-09 07:58:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584990383] [2024-11-09 07:58:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584990383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516105629] [2024-11-09 07:58:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:44,976 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-09 07:58:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:45,079 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-09 07:58:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 27 [2024-11-09 07:58:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:45,081 INFO L225 Difference]: With dead ends: 115 [2024-11-09 07:58:45,081 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 07:58:45,081 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-09 07:58:45,082 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:45,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 246 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 07:58:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 07:58:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 113 states have internal predecessors, (123), 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-09 07:58:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-09 07:58:45,085 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 27 [2024-11-09 07:58:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:45,085 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-09 07:58:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-09 07:58:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-09 07:58:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:58:45,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:45,086 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] [2024-11-09 07:58:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:58:45,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash -523665568, now seen corresponding path program 1 times [2024-11-09 07:58:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711294029] [2024-11-09 07:58:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:45,794 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-09 07:58:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711294029] [2024-11-09 07:58:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711294029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 07:58:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463175163] [2024-11-09 07:58:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:58:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:58:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:58:45,797 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-09 07:58:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:46,361 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2024-11-09 07:58:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:58:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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 27 [2024-11-09 07:58:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:46,363 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:58:46,363 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 07:58:46,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:58:46,364 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 243 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 544 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:58:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 07:58:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-09 07:58:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 131 states have internal predecessors, (143), 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-09 07:58:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-11-09 07:58:46,370 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 27 [2024-11-09 07:58:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:46,370 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-11-09 07:58:46,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-09 07:58:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-11-09 07:58:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:58:46,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:46,373 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-09 07:58:46,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:58:46,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:46,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -29938955, now seen corresponding path program 1 times [2024-11-09 07:58:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307275485] [2024-11-09 07:58:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:46,711 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-09 07:58:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307275485] [2024-11-09 07:58:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307275485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:46,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:58:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803249726] [2024-11-09 07:58:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:58:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:58:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:46,713 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:47,115 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2024-11-09 07:58:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:58:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:47,116 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:58:47,116 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:58:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:58:47,117 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 207 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:47,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 289 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:58:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 139. [2024-11-09 07:58:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 137 states have internal predecessors, (150), 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-09 07:58:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-11-09 07:58:47,121 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 28 [2024-11-09 07:58:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-11-09 07:58:47,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-11-09 07:58:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:58:47,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:47,122 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-09 07:58:47,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:58:47,122 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -29938954, now seen corresponding path program 1 times [2024-11-09 07:58:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212728192] [2024-11-09 07:58:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:47,576 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-09 07:58:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212728192] [2024-11-09 07:58:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212728192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:58:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744600083] [2024-11-09 07:58:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:47,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:58:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:58:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:47,581 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,054 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2024-11-09 07:58:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:58:48,055 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,056 INFO L225 Difference]: With dead ends: 195 [2024-11-09 07:58:48,056 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 07:58:48,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:58:48,057 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 100 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 374 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 07:58:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 139. [2024-11-09 07:58:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 137 states have internal predecessors, (149), 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-09 07:58:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-09 07:58:48,061 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 28 [2024-11-09 07:58:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-09 07:58:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-09 07:58:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-09 07:58:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:58:48,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,062 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-09 07:58:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:58:48,063 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 946315059, now seen corresponding path program 1 times [2024-11-09 07:58:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766541812] [2024-11-09 07:58:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766541812] [2024-11-09 07:58:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766541812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076070353] [2024-11-09 07:58:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:48,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:48,426 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-09 07:58:48,428 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-09 07:58:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:58:48,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:48,718 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:58:48,719 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-09 07:58:48,769 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-09 07:58:48,884 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:48,884 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-09 07:58:48,954 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:48,955 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-09 07:58:49,088 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-09 07:58:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:49,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:49,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_59| Int) (v_ArrVal_681 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_681))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_682)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_59|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_59| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_59|))) is different from false [2024-11-09 07:58:49,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:49,503 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-09 07:58:49,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:49,516 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-09 07:58:49,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:49,540 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-09 07:58:49,547 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-09 07:58:50,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:50,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 254 [2024-11-09 07:58:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076070353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:58:52,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:58:52,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2024-11-09 07:58:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469089149] [2024-11-09 07:58:52,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:52,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:58:52,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:58:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=939, Unknown=15, NotChecked=64, Total=1190 [2024-11-09 07:58:52,428 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 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-09 07:58:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:53,618 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2024-11-09 07:58:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:58:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 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-09 07:58:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:53,619 INFO L225 Difference]: With dead ends: 192 [2024-11-09 07:58:53,619 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 07:58:53,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=302, Invalid=1578, Unknown=16, NotChecked=84, Total=1980 [2024-11-09 07:58:53,621 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 376 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:53,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 766 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1217 Invalid, 0 Unknown, 187 Unchecked, 0.9s Time] [2024-11-09 07:58:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 07:58:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2024-11-09 07:58:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 141 states have internal predecessors, (154), 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-09 07:58:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2024-11-09 07:58:53,624 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 28 [2024-11-09 07:58:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:53,625 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2024-11-09 07:58:53,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 states have internal predecessors, (80), 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-09 07:58:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2024-11-09 07:58:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:58:53,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:53,625 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-09 07:58:53,640 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-09 07:58:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:53,828 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 946315060, now seen corresponding path program 1 times [2024-11-09 07:58:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138636890] [2024-11-09 07:58:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138636890] [2024-11-09 07:58:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138636890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:54,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500879122] [2024-11-09 07:58:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:54,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:54,352 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-09 07:58:54,354 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-09 07:58:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:54,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:58:54,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:54,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:58:54,600 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-09 07:58:54,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:58:54,657 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-09 07:58:54,760 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:54,761 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-09 07:58:54,765 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-09 07:58:54,791 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-09 07:58:54,823 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-09 07:58:54,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:54,906 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 17 treesize of output 15 [2024-11-09 07:58:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:54,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:58:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500879122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:58:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2024-11-09 07:58:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480129322] [2024-11-09 07:58:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:54,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:58:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:58:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:58:54,967 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-09 07:58:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:55,302 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2024-11-09 07:58:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:58:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-09 07:58:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:55,305 INFO L225 Difference]: With dead ends: 165 [2024-11-09 07:58:55,305 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 07:58:55,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:58:55,306 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 115 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:55,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 303 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 07:58:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2024-11-09 07:58:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 135 states have internal predecessors, (146), 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-09 07:58:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-09 07:58:55,310 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 28 [2024-11-09 07:58:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:55,310 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-09 07:58:55,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-09 07:58:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-09 07:58:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:58:55,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:55,311 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-09 07:58:55,326 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-09 07:58:55,515 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,SelfDestructingSolverStorable19 [2024-11-09 07:58:55,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1750547211, now seen corresponding path program 1 times [2024-11-09 07:58:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:55,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072301979] [2024-11-09 07:58:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:56,118 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-09 07:58:56,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:56,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072301979] [2024-11-09 07:58:56,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072301979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:56,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:58:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440970312] [2024-11-09 07:58:56,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:56,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:58:56,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:56,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:58:56,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:58:56,123 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-09 07:58:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:56,590 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2024-11-09 07:58:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:58:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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 32 [2024-11-09 07:58:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:56,592 INFO L225 Difference]: With dead ends: 162 [2024-11-09 07:58:56,592 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 07:58:56,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:58:56,593 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 128 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:56,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 498 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 07:58:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2024-11-09 07:58:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 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-09 07:58:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-09 07:58:56,598 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 32 [2024-11-09 07:58:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:56,599 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-09 07:58:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-09 07:58:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-09 07:58:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:58:56,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:56,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:56,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:58:56,600 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1143824070, now seen corresponding path program 1 times [2024-11-09 07:58:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855592947] [2024-11-09 07:58:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:56,670 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-09 07:58:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855592947] [2024-11-09 07:58:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855592947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961078415] [2024-11-09 07:58:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:56,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:56,673 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09 07:58:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:56,787 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-09 07:58:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:56,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 38 [2024-11-09 07:58:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:56,791 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:58:56,791 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:58:56,791 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-09 07:58:56,792 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:56,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 230 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:58:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 07:58:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2024-11-09 07:58:56,796 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 38 [2024-11-09 07:58:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:56,796 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2024-11-09 07:58:56,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09 07:58:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2024-11-09 07:58:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:58:56,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:56,797 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] [2024-11-09 07:58:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:58:56,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1904147382, now seen corresponding path program 1 times [2024-11-09 07:58:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642206216] [2024-11-09 07:58:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:56,879 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-09 07:58:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:56,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642206216] [2024-11-09 07:58:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642206216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118847100] [2024-11-09 07:58:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:56,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:56,882 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-09 07:58:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:57,010 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2024-11-09 07:58:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:57,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-09 07:58:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:57,011 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:58:57,011 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 07:58:57,012 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-09 07:58:57,012 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 82 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:57,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 112 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 07:58:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2024-11-09 07:58:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2024-11-09 07:58:57,016 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 37 [2024-11-09 07:58:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:57,017 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2024-11-09 07:58:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-09 07:58:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2024-11-09 07:58:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:58:57,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:57,018 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] [2024-11-09 07:58:57,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:58:57,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1143729994, now seen corresponding path program 1 times [2024-11-09 07:58:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744584192] [2024-11-09 07:58:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:57,417 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-09 07:58:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744584192] [2024-11-09 07:58:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744584192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:58:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856722258] [2024-11-09 07:58:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:57,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:58:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:58:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:57,420 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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-09 07:58:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:57,736 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2024-11-09 07:58:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:58:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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 38 [2024-11-09 07:58:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:57,738 INFO L225 Difference]: With dead ends: 163 [2024-11-09 07:58:57,738 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 07:58:57,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:58:57,739 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:57,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 313 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 07:58:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2024-11-09 07:58:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 146 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2024-11-09 07:58:57,743 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 38 [2024-11-09 07:58:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:57,743 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2024-11-09 07:58:57,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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-09 07:58:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2024-11-09 07:58:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:58:57,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:57,744 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-09 07:58:57,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:58:57,745 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:58:57,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1682178161, now seen corresponding path program 1 times [2024-11-09 07:58:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741337637] [2024-11-09 07:58:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:58,612 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-09 07:58:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741337637] [2024-11-09 07:58:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741337637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357085833] [2024-11-09 07:58:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:58,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:58,615 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-09 07:58:58,617 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-09 07:58:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:58,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:58:58,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:58,759 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-09 07:58:58,771 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-09 07:58:58,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:58:58,820 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-09 07:58:58,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:58:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:58:58,850 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-09 07:58:58,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:58,925 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-09 07:58:58,932 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-09 07:58:58,958 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-09 07:58:58,987 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-09 07:58:59,030 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-09 07:58:59,064 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:58:59,064 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-09 07:58:59,077 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-09 07:58:59,088 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-09 07:58:59,174 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:59,175 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-09 07:58:59,178 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-09 07:58:59,196 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-09 07:58:59,204 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-09 07:58:59,226 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-09 07:58:59,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:59,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1108) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 07:58:59,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1108) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1109) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 07:58:59,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:59,332 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-09 07:58:59,337 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-09 07:58:59,341 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-09 07:58:59,368 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) .cse2) (or (not .cse2) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) is different from false [2024-11-09 07:59:00,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:00,172 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-09 07:59:00,180 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-09 07:59:00,189 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-09 07:59:00,349 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-09 07:59:00,349 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-09 07:59:00,376 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-09 07:59:08,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse5 (not .cse0)) (.cse16 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int)) (or (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 v_arrayElimCell_53) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse5) (or .cse0 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse5 (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10)) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_arrayElimCell_46 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse16)) (or (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0) (or (and .cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse0) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) .cse10)) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106))) (or (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int)) (or (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= v_prenex_18 v_arrayElimCell_53))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse1)) (or .cse5 (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106))) (or (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 v_arrayElimCell_53) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and .cse16 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (and .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_46 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse0) (or (and .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0)))) is different from false