./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.dd.update-z3-fca748b-m [2024-11-20 14:52:29,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:52:29,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:52:29,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:52:29,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:52:29,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:52:29,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:52:29,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:52:29,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:52:29,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:52:29,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:52:29,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:52:29,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:52:29,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:52:29,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:52:29,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:52:29,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:52:29,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:52:29,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:52:29,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:52:29,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:52:29,632 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:52:29,633 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:52:29,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:52:29,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:52:29,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:52:29,634 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:52:29,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:52:29,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:52:29,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:52:29,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:52:29,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:52:29,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:52:29,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:52:29,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:52:29,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:52:29,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:52:29,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:52:29,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:52:29,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:52:29,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:52:29,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:52:29,637 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-20 14:52:29,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:52:29,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:52:29,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:52:29,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:52:29,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:52:29,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-20 14:52:31,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:52:31,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:52:31,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-20 14:52:31,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd31815af/9d9a885a2e47481b91855010e8db28d9/FLAG5239252b6 [2024-11-20 14:52:32,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd31815af/9d9a885a2e47481b91855010e8db28d9 [2024-11-20 14:52:32,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:52:32,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:52:32,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:52:32,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:52:32,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:52:32,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffed8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32, skipping insertion in model container [2024-11-20 14:52:32,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:52:32,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:52:32,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:52:32,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:52:32,458 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:52:32,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32 WrapperNode [2024-11-20 14:52:32,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:52:32,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:52:32,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:52:32,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:52:32,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,503 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-11-20 14:52:32,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:52:32,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:52:32,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:52:32,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:52:32,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,535 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-20 14:52:32,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:52:32,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:52:32,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:52:32,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:52:32,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (1/1) ... [2024-11-20 14:52:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:52:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:32,591 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-20 14:52:32,594 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-20 14:52:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:52:32,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:52:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:52:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:52:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:52:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:52:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:52:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:52:32,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:52:32,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:52:32,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:52:33,137 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-20 14:52:33,138 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:52:33,153 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:52:33,153 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-20 14:52:33,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:52:33 BoogieIcfgContainer [2024-11-20 14:52:33,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:52:33,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:52:33,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:52:33,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:52:33,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:52:32" (1/3) ... [2024-11-20 14:52:33,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2140cf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:52:33, skipping insertion in model container [2024-11-20 14:52:33,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:32" (2/3) ... [2024-11-20 14:52:33,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2140cf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:52:33, skipping insertion in model container [2024-11-20 14:52:33,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:52:33" (3/3) ... [2024-11-20 14:52:33,165 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2024-11-20 14:52:33,181 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:52:33,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-20 14:52:33,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:52:33,229 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;@17b807ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:52:33,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-20 14:52:33,233 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-20 14:52:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:52:33,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:33,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:52:33,238 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-20 14:52:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-20 14:52:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139656211] [2024-11-20 14:52:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:33,460 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-20 14:52:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139656211] [2024-11-20 14:52:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139656211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:52:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264743090] [2024-11-20 14:52:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:33,513 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-20 14:52:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:33,676 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2024-11-20 14:52:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:33,678 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-20 14:52:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:33,686 INFO L225 Difference]: With dead ends: 130 [2024-11-20 14:52:33,686 INFO L226 Difference]: Without dead ends: 128 [2024-11-20 14:52:33,688 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-20 14:52:33,692 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-20 14:52:33,692 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-20 14:52:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-20 14:52:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-20 14:52:33,727 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-20 14:52:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2024-11-20 14:52:33,731 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2024-11-20 14:52:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2024-11-20 14:52:33,733 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-20 14:52:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-11-20 14:52:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:52:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:33,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:52:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:52:33,735 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-20 14:52:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-20 14:52:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065448821] [2024-11-20 14:52:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:33,877 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-20 14:52:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065448821] [2024-11-20 14:52:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065448821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:33,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:52:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836789655] [2024-11-20 14:52:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:33,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:33,883 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-20 14:52:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:34,024 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-20 14:52:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:34,027 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-20 14:52:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:34,030 INFO L225 Difference]: With dead ends: 125 [2024-11-20 14:52:34,030 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 14:52:34,030 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-20 14:52:34,031 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-20 14:52:34,033 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-20 14:52:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 14:52:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-20 14:52:34,043 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-20 14:52:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-20 14:52:34,045 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 3 [2024-11-20 14:52:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:34,046 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-20 14:52:34,046 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-20 14:52:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-20 14:52:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:52:34,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:34,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:34,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:52:34,047 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-20 14:52:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 919164508, now seen corresponding path program 1 times [2024-11-20 14:52:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:34,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786139459] [2024-11-20 14:52:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:34,167 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-20 14:52:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786139459] [2024-11-20 14:52:34,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786139459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:34,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629099932] [2024-11-20 14:52:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:34,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:34,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:34,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:34,170 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-20 14:52:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:34,357 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-20 14:52:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:34,358 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-20 14:52:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:34,359 INFO L225 Difference]: With dead ends: 112 [2024-11-20 14:52:34,359 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 14:52:34,360 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-20 14:52:34,361 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-20 14:52:34,361 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-20 14:52:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 14:52:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 14:52:34,374 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-20 14:52:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-20 14:52:34,376 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 9 [2024-11-20 14:52:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:34,378 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-20 14:52:34,379 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-20 14:52:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-20 14:52:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:52:34,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:34,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:34,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:52:34,380 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-20 14:52:34,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 919164509, now seen corresponding path program 1 times [2024-11-20 14:52:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786391205] [2024-11-20 14:52:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:34,575 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-20 14:52:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786391205] [2024-11-20 14:52:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786391205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256742083] [2024-11-20 14:52:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:34,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:34,579 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-20 14:52:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:34,797 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-20 14:52:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:34,798 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-20 14:52:34,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:34,800 INFO L225 Difference]: With dead ends: 159 [2024-11-20 14:52:34,800 INFO L226 Difference]: Without dead ends: 159 [2024-11-20 14:52:34,801 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-20 14:52:34,802 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 14:52:34,804 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-20 14:52:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-20 14:52:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-20 14:52:34,818 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-20 14:52:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-20 14:52:34,819 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 9 [2024-11-20 14:52:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:34,820 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-20 14:52:34,820 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-20 14:52:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-20 14:52:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:52:34,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:34,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:52:34,821 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-20 14:52:34,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-20 14:52:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325525537] [2024-11-20 14:52:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:34,987 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-20 14:52:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325525537] [2024-11-20 14:52:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325525537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058160682] [2024-11-20 14:52:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:34,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:34,991 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-20 14:52:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:35,131 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-20 14:52:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:35,132 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-20 14:52:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:35,133 INFO L225 Difference]: With dead ends: 148 [2024-11-20 14:52:35,133 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 14:52:35,133 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-20 14:52:35,134 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-20 14:52:35,134 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-20 14:52:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 14:52:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-20 14:52:35,141 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-20 14:52:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-20 14:52:35,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 12 [2024-11-20 14:52:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-20 14:52:35,143 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-20 14:52:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2024-11-20 14:52:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:52:35,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:35,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:52:35,144 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-20 14:52:35,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-20 14:52:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706145104] [2024-11-20 14:52:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:35,358 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-20 14:52:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706145104] [2024-11-20 14:52:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706145104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:35,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:35,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814988948] [2024-11-20 14:52:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:35,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:35,363 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-20 14:52:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:35,523 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-20 14:52:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:35,523 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-20 14:52:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:35,524 INFO L225 Difference]: With dead ends: 147 [2024-11-20 14:52:35,524 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 14:52:35,524 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-20 14:52:35,525 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-20 14:52:35,525 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-20 14:52:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 14:52:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-20 14:52:35,537 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-20 14:52:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-11-20 14:52:35,539 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 12 [2024-11-20 14:52:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:35,539 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-11-20 14:52:35,543 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-20 14:52:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-11-20 14:52:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:52:35,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:35,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:52:35,544 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-20 14:52:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -14975914, now seen corresponding path program 1 times [2024-11-20 14:52:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123438433] [2024-11-20 14:52:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:35,652 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-20 14:52:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:35,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123438433] [2024-11-20 14:52:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123438433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019836744] [2024-11-20 14:52:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:35,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:35,654 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-20 14:52:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:35,790 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2024-11-20 14:52:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:35,791 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-20 14:52:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:35,792 INFO L225 Difference]: With dead ends: 146 [2024-11-20 14:52:35,792 INFO L226 Difference]: Without dead ends: 146 [2024-11-20 14:52:35,792 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-20 14:52:35,793 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-20 14:52:35,795 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-20 14:52:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-20 14:52:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-20 14:52:35,803 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-20 14:52:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2024-11-20 14:52:35,804 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 14 [2024-11-20 14:52:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:35,804 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2024-11-20 14:52:35,804 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-20 14:52:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2024-11-20 14:52:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:52:35,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:35,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:52:35,808 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-20 14:52:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash -14975913, now seen corresponding path program 1 times [2024-11-20 14:52:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710314588] [2024-11-20 14:52:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:35,982 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-20 14:52:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:35,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710314588] [2024-11-20 14:52:35,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710314588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:35,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:35,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990567857] [2024-11-20 14:52:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:35,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:35,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:35,985 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-20 14:52:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:36,135 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2024-11-20 14:52:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:36,136 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-20 14:52:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:36,137 INFO L225 Difference]: With dead ends: 145 [2024-11-20 14:52:36,137 INFO L226 Difference]: Without dead ends: 145 [2024-11-20 14:52:36,137 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-20 14:52:36,139 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-20 14:52:36,139 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-20 14:52:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-20 14:52:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-20 14:52:36,145 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-20 14:52:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-11-20 14:52:36,149 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 14 [2024-11-20 14:52:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:36,149 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-11-20 14:52:36,149 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-20 14:52:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-11-20 14:52:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:52:36,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:36,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:36,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:52:36,150 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-20 14:52:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-20 14:52:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773320509] [2024-11-20 14:52:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:36,413 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-20 14:52:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773320509] [2024-11-20 14:52:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773320509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:36,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:52:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500225921] [2024-11-20 14:52:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:52:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:52:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:52:36,418 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-20 14:52:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:36,735 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-20 14:52:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:52:36,736 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-20 14:52:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:36,737 INFO L225 Difference]: With dead ends: 144 [2024-11-20 14:52:36,737 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 14:52:36,737 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-20 14:52:36,738 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-20 14:52:36,738 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-20 14:52:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 14:52:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-20 14:52:36,741 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-20 14:52:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-20 14:52:36,742 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 16 [2024-11-20 14:52:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:36,742 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-20 14:52:36,742 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-20 14:52:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-20 14:52:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:52:36,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:36,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:52:36,744 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-20 14:52:36,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-20 14:52:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119817116] [2024-11-20 14:52:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:36,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:37,017 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-20 14:52:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119817116] [2024-11-20 14:52:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119817116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:52:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834283432] [2024-11-20 14:52:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:37,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:52:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:52:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:37,019 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-20 14:52:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:37,493 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2024-11-20 14:52:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:52:37,493 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-20 14:52:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:37,494 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:52:37,494 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:52:37,495 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-20 14:52:37,495 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-20 14:52:37,495 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-20 14:52:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:52:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2024-11-20 14:52:37,498 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-20 14:52:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2024-11-20 14:52:37,499 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 16 [2024-11-20 14:52:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:37,499 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2024-11-20 14:52:37,499 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-20 14:52:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2024-11-20 14:52:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:52:37,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:37,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:37,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:52:37,501 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-20 14:52:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 529199460, now seen corresponding path program 1 times [2024-11-20 14:52:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114815664] [2024-11-20 14:52:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:37,681 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-20 14:52:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114815664] [2024-11-20 14:52:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114815664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:37,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:37,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177969917] [2024-11-20 14:52:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:37,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:52:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:52:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:37,683 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-20 14:52:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:37,924 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2024-11-20 14:52:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:52:37,924 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-20 14:52:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:37,925 INFO L225 Difference]: With dead ends: 123 [2024-11-20 14:52:37,925 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 14:52:37,925 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-20 14:52:37,926 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-20 14:52:37,926 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-20 14:52:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 14:52:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-20 14:52:37,929 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-20 14:52:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-11-20 14:52:37,929 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 17 [2024-11-20 14:52:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-11-20 14:52:37,930 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-20 14:52:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-11-20 14:52:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:52:37,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:37,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:52:37,931 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-20 14:52:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 529199461, now seen corresponding path program 1 times [2024-11-20 14:52:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954848490] [2024-11-20 14:52:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:38,199 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-20 14:52:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954848490] [2024-11-20 14:52:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954848490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:38,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:38,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283203902] [2024-11-20 14:52:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:52:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:52:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:38,201 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-20 14:52:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:38,483 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-11-20 14:52:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:52:38,484 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-20 14:52:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:38,484 INFO L225 Difference]: With dead ends: 122 [2024-11-20 14:52:38,485 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 14:52:38,485 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-20 14:52:38,485 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-20 14:52:38,485 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-20 14:52:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 14:52:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-20 14:52:38,488 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-20 14:52:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-20 14:52:38,488 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 17 [2024-11-20 14:52:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:38,489 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-20 14:52:38,489 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-20 14:52:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-20 14:52:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:52:38,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:38,490 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-20 14:52:38,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:52:38,490 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-20 14:52:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2028654876, now seen corresponding path program 1 times [2024-11-20 14:52:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639860727] [2024-11-20 14:52:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:38,571 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-20 14:52:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639860727] [2024-11-20 14:52:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639860727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798425646] [2024-11-20 14:52:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:52:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:38,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:52:38,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:52:38,574 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-20 14:52:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:38,714 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-20 14:52:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:52:38,714 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-20 14:52:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:38,715 INFO L225 Difference]: With dead ends: 121 [2024-11-20 14:52:38,715 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 14:52:38,716 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-20 14:52:38,716 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-20 14:52:38,716 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-20 14:52:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 14:52:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-20 14:52:38,719 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-20 14:52:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-20 14:52:38,719 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 20 [2024-11-20 14:52:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:38,720 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-20 14:52:38,720 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-20 14:52:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-20 14:52:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:52:38,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:38,722 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-20 14:52:38,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:52:38,723 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-20 14:52:38,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -187413698, now seen corresponding path program 1 times [2024-11-20 14:52:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147210022] [2024-11-20 14:52:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:38,775 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-20 14:52:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147210022] [2024-11-20 14:52:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147210022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529570422] [2024-11-20 14:52:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:38,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:38,777 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-20 14:52:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:38,879 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2024-11-20 14:52:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:38,879 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-20 14:52:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:38,880 INFO L225 Difference]: With dead ends: 142 [2024-11-20 14:52:38,880 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 14:52:38,880 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-20 14:52:38,881 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-20 14:52:38,881 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-20 14:52:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 14:52:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-20 14:52:38,883 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-20 14:52:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2024-11-20 14:52:38,884 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2024-11-20 14:52:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:38,884 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2024-11-20 14:52:38,884 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-20 14:52:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2024-11-20 14:52:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:52:38,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:38,885 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-20 14:52:38,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:52:38,886 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-20 14:52:38,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -555182524, now seen corresponding path program 1 times [2024-11-20 14:52:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:38,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018778314] [2024-11-20 14:52:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:38,938 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-20 14:52:38,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018778314] [2024-11-20 14:52:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018778314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:38,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:38,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:38,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992478856] [2024-11-20 14:52:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:38,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:38,940 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-20 14:52:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:39,042 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-20 14:52:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:39,043 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-20 14:52:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:39,043 INFO L225 Difference]: With dead ends: 115 [2024-11-20 14:52:39,043 INFO L226 Difference]: Without dead ends: 115 [2024-11-20 14:52:39,044 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-20 14:52:39,046 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-20 14:52:39,046 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-20 14:52:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-20 14:52:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-20 14:52:39,048 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-20 14:52:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-20 14:52:39,050 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 27 [2024-11-20 14:52:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:39,050 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-20 14:52:39,050 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-20 14:52:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-20 14:52:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:52:39,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:39,051 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-20 14:52:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:52:39,053 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-20 14:52:39,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash -523665568, now seen corresponding path program 1 times [2024-11-20 14:52:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633275707] [2024-11-20 14:52:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:39,749 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-20 14:52:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633275707] [2024-11-20 14:52:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633275707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 14:52:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085761322] [2024-11-20 14:52:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 14:52:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 14:52:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:52:39,751 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-20 14:52:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:40,310 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2024-11-20 14:52:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 14:52:40,311 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-20 14:52:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:40,313 INFO L225 Difference]: With dead ends: 214 [2024-11-20 14:52:40,313 INFO L226 Difference]: Without dead ends: 214 [2024-11-20 14:52:40,313 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-20 14:52:40,314 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-20 14:52:40,314 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-20 14:52:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-20 14:52:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-20 14:52:40,318 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-20 14:52:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-11-20 14:52:40,319 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 27 [2024-11-20 14:52:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-11-20 14:52:40,319 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-20 14:52:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-11-20 14:52:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:52:40,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:40,321 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-20 14:52:40,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:52:40,322 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-20 14:52:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -29938955, now seen corresponding path program 1 times [2024-11-20 14:52:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375045] [2024-11-20 14:52:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:40,677 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-20 14:52:40,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375045] [2024-11-20 14:52:40,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:40,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:40,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:52:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169405120] [2024-11-20 14:52:40,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:40,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:52:40,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:52:40,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:52:40,679 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-20 14:52:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:41,066 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2024-11-20 14:52:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:52:41,066 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-20 14:52:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:41,067 INFO L225 Difference]: With dead ends: 190 [2024-11-20 14:52:41,067 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 14:52:41,067 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-20 14:52:41,068 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 207 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 14:52:41,068 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-20 14:52:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 14:52:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 139. [2024-11-20 14:52:41,071 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-20 14:52:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-11-20 14:52:41,071 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 28 [2024-11-20 14:52:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-11-20 14:52:41,072 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-20 14:52:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-11-20 14:52:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:52:41,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:41,073 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-20 14:52:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:52:41,073 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-20 14:52:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -29938954, now seen corresponding path program 1 times [2024-11-20 14:52:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701421544] [2024-11-20 14:52:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:41,500 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-20 14:52:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701421544] [2024-11-20 14:52:41,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701421544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:41,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:41,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:52:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371576036] [2024-11-20 14:52:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:41,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:52:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:52:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:52:41,502 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-20 14:52:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:41,955 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2024-11-20 14:52:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:52:41,956 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-20 14:52:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:41,956 INFO L225 Difference]: With dead ends: 195 [2024-11-20 14:52:41,957 INFO L226 Difference]: Without dead ends: 195 [2024-11-20 14:52:41,957 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-20 14:52:41,957 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-20 14:52:41,958 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-20 14:52:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-20 14:52:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 139. [2024-11-20 14:52:41,960 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-20 14:52:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-20 14:52:41,961 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 28 [2024-11-20 14:52:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-20 14:52:41,961 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-20 14:52:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-20 14:52:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:52:41,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:41,962 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-20 14:52:41,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:52:41,962 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-20 14:52:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 946315059, now seen corresponding path program 1 times [2024-11-20 14:52:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867138997] [2024-11-20 14:52:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:42,361 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-20 14:52:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867138997] [2024-11-20 14:52:42,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867138997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559542145] [2024-11-20 14:52:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:42,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:42,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:42,364 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-20 14:52:42,366 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-20 14:52:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:42,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 14:52:42,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:42,621 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:52:42,622 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-20 14:52:42,674 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-20 14:52:42,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:42,784 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-20 14:52:42,850 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:42,850 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-20 14:52:42,976 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-20 14:52:43,064 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-20 14:52:43,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:43,333 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| |c_ULTIMATE.start_main_#t~mem7#1.base| 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-20 14:52:43,350 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-20 14:52:43,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:43,376 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-20 14:52:43,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:43,388 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-20 14:52:43,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:43,411 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-20 14:52:43,419 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-20 14:52:44,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:44,344 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-20 14:52:46,137 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-20 14:52:46,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559542145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:46,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2024-11-20 14:52:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998120597] [2024-11-20 14:52:46,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:46,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 14:52:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 14:52:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=8, NotChecked=126, Total=1190 [2024-11-20 14:52:46,140 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-20 14:52:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:47,267 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2024-11-20 14:52:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:52:47,268 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-20 14:52:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:47,269 INFO L225 Difference]: With dead ends: 192 [2024-11-20 14:52:47,269 INFO L226 Difference]: Without dead ends: 192 [2024-11-20 14:52:47,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=8, NotChecked=166, Total=1980 [2024-11-20 14:52:47,270 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 376 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:47,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 736 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1141 Invalid, 0 Unknown, 375 Unchecked, 0.8s Time] [2024-11-20 14:52:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-20 14:52:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2024-11-20 14:52:47,273 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-20 14:52:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2024-11-20 14:52:47,274 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 28 [2024-11-20 14:52:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:47,274 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2024-11-20 14:52:47,275 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-20 14:52:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2024-11-20 14:52:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:52:47,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:47,275 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-20 14:52:47,285 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-20 14:52:47,479 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-20 14:52:47,480 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-20 14:52:47,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 946315060, now seen corresponding path program 1 times [2024-11-20 14:52:47,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:47,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394080484] [2024-11-20 14:52:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:47,975 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-20 14:52:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394080484] [2024-11-20 14:52:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394080484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213729335] [2024-11-20 14:52:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:47,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:47,978 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-20 14:52:47,980 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-20 14:52:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:48,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-20 14:52:48,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:48,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:52:48,222 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-20 14:52:48,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:52:48,275 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-20 14:52:48,285 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-20 14:52:48,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:48,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-20 14:52:48,393 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-20 14:52:48,472 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:48,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-20 14:52:48,478 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-20 14:52:48,620 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-20 14:52:48,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:52:48,662 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-20 14:52:48,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:48,946 WARN L851 $PredicateComparison]: unable to prove that (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|))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (< (+ 11 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_781) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_65|) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0))) (forall ((v_ArrVal_782 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_65|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0))))) is different from false [2024-11-20 14:52:49,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,248 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 73 treesize of output 74 [2024-11-20 14:52:49,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,257 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 65 treesize of output 50 [2024-11-20 14:52:49,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,269 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 632 treesize of output 567 [2024-11-20 14:52:49,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,311 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 1127 treesize of output 1070 [2024-11-20 14:52:49,348 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 547 treesize of output 523 [2024-11-20 14:52:49,361 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 523 treesize of output 499 [2024-11-20 14:52:49,374 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 499 treesize of output 491 [2024-11-20 14:52:49,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,395 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 491 treesize of output 447 [2024-11-20 14:52:49,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,775 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 39 [2024-11-20 14:52:49,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,785 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 30 treesize of output 31 [2024-11-20 14:52:49,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:49,790 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 28 treesize of output 20 [2024-11-20 14:52:49,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:49,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:52:49,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:52:49,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-20 14:52:49,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:49,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2024-11-20 14:52:50,528 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-20 14:52:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213729335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:50,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 36 [2024-11-20 14:52:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854826432] [2024-11-20 14:52:50,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:50,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-20 14:52:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-20 14:52:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1091, Unknown=25, NotChecked=68, Total=1332 [2024-11-20 14:52:50,530 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-20 14:52:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:52,183 INFO L93 Difference]: Finished difference Result 198 states and 218 transitions. [2024-11-20 14:52:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 14:52:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-20 14:52:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:52,185 INFO L225 Difference]: With dead ends: 198 [2024-11-20 14:52:52,185 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 14:52:52,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=427, Invalid=2630, Unknown=27, NotChecked=108, Total=3192 [2024-11-20 14:52:52,186 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 443 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:52,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 936 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1310 Invalid, 0 Unknown, 193 Unchecked, 0.9s Time] [2024-11-20 14:52:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 14:52:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 139. [2024-11-20 14:52:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.2844827586206897) 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-20 14:52:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-20 14:52:52,190 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 28 [2024-11-20 14:52:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:52,190 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-20 14:52:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-20 14:52:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-20 14:52:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:52:52,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:52,191 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-20 14:52:52,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:52:52,391 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-20 14:52:52,392 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-20 14:52:52,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1750547211, now seen corresponding path program 1 times [2024-11-20 14:52:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605567587] [2024-11-20 14:52:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:52,982 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-20 14:52:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:52,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605567587] [2024-11-20 14:52:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605567587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:52,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:52,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 14:52:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229197153] [2024-11-20 14:52:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:52:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:52,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:52:52,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:52:52,985 INFO L87 Difference]: Start difference. First operand 139 states and 152 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-20 14:52:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:53,415 INFO L93 Difference]: Finished difference Result 198 states and 218 transitions. [2024-11-20 14:52:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:52:53,415 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-20 14:52:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:53,416 INFO L225 Difference]: With dead ends: 198 [2024-11-20 14:52:53,416 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 14:52:53,416 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-20 14:52:53,417 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 167 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:53,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 472 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 14:52:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 140. [2024-11-20 14:52:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 138 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-20 14:52:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-20 14:52:53,420 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 32 [2024-11-20 14:52:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:53,420 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-20 14:52:53,421 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-20 14:52:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-20 14:52:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:52:53,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:53,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:53,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:52:53,422 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-20 14:52:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash 948356765, now seen corresponding path program 1 times [2024-11-20 14:52:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567927965] [2024-11-20 14:52:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567927965] [2024-11-20 14:52:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567927965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 14:52:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567264765] [2024-11-20 14:52:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:52:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:52:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:52:53,899 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-20 14:52:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:54,256 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2024-11-20 14:52:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:52:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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 34 [2024-11-20 14:52:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:54,257 INFO L225 Difference]: With dead ends: 161 [2024-11-20 14:52:54,258 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 14:52:54,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:52:54,258 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 134 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:54,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 389 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 14:52:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2024-11-20 14:52:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 133 states have internal predecessors, (144), 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-20 14:52:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-20 14:52:54,262 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 34 [2024-11-20 14:52:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:54,262 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-20 14:52:54,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-20 14:52:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-20 14:52:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:52:54,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:54,263 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-20 14:52:54,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:52:54,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-20 14:52:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1143824070, now seen corresponding path program 1 times [2024-11-20 14:52:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562293641] [2024-11-20 14:52:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:54,319 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-20 14:52:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562293641] [2024-11-20 14:52:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562293641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786767473] [2024-11-20 14:52:54,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:54,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:54,321 INFO L87 Difference]: Start difference. First operand 135 states and 147 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-20 14:52:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:54,427 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2024-11-20 14:52:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:54,428 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-20 14:52:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:54,428 INFO L225 Difference]: With dead ends: 134 [2024-11-20 14:52:54,429 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 14:52:54,429 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-20 14:52:54,429 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:54,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 226 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 14:52:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-20 14:52:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 132 states have internal predecessors, (142), 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-20 14:52:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2024-11-20 14:52:54,435 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 38 [2024-11-20 14:52:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:54,436 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2024-11-20 14:52:54,436 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-20 14:52:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-11-20 14:52:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 14:52:54,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:54,436 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-20 14:52:54,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:52:54,437 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-20 14:52:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1904147382, now seen corresponding path program 1 times [2024-11-20 14:52:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:54,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605038441] [2024-11-20 14:52:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:54,516 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-20 14:52:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605038441] [2024-11-20 14:52:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605038441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:54,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078617465] [2024-11-20 14:52:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:54,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:54,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:54,518 INFO L87 Difference]: Start difference. First operand 134 states and 144 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-20 14:52:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:54,637 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2024-11-20 14:52:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:54,637 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-20 14:52:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:54,638 INFO L225 Difference]: With dead ends: 146 [2024-11-20 14:52:54,638 INFO L226 Difference]: Without dead ends: 146 [2024-11-20 14:52:54,638 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-20 14:52:54,639 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 80 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:54,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 108 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-20 14:52:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2024-11-20 14:52:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.263157894736842) internal successors, (144), 134 states have internal predecessors, (144), 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-20 14:52:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-20 14:52:54,643 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 37 [2024-11-20 14:52:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:54,644 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-20 14:52:54,644 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-20 14:52:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-20 14:52:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:52:54,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:54,644 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-20 14:52:54,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:52:54,645 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-20 14:52:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1143729994, now seen corresponding path program 1 times [2024-11-20 14:52:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120389399] [2024-11-20 14:52:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:55,009 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-20 14:52:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120389399] [2024-11-20 14:52:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120389399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:55,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:55,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:52:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764931263] [2024-11-20 14:52:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:55,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:52:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:52:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:52:55,011 INFO L87 Difference]: Start difference. First operand 136 states and 146 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-20 14:52:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:55,415 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2024-11-20 14:52:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:52:55,415 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-20 14:52:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:55,416 INFO L225 Difference]: With dead ends: 160 [2024-11-20 14:52:55,416 INFO L226 Difference]: Without dead ends: 160 [2024-11-20 14:52:55,416 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-20 14:52:55,416 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:55,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 422 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-20 14:52:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2024-11-20 14:52:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 143 states have internal predecessors, (154), 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-20 14:52:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2024-11-20 14:52:55,420 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 38 [2024-11-20 14:52:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:55,421 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2024-11-20 14:52:55,421 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-20 14:52:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2024-11-20 14:52:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-20 14:52:55,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:55,422 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-20 14:52:55,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:52:55,422 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-20 14:52:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1682178161, now seen corresponding path program 1 times [2024-11-20 14:52:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:55,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605978235] [2024-11-20 14:52:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:56,319 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-20 14:52:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605978235] [2024-11-20 14:52:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605978235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472212449] [2024-11-20 14:52:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:56,321 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-20 14:52:56,322 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-20 14:52:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:56,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 14:52:56,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:56,453 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-20 14:52:56,462 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-20 14:52:56,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:52:56,507 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-20 14:52:56,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:52:56,526 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-20 14:52:56,539 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-20 14:52:56,624 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:56,624 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-20 14:52:56,631 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-20 14:52:56,658 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-20 14:52:56,673 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-20 14:52:56,713 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-20 14:52:56,734 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 14:52:56,734 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-20 14:52:56,744 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-20 14:52:56,750 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-20 14:52:56,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:56,836 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-20 14:52:56,843 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-20 14:52:56,867 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-20 14:52:56,874 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-20 14:52:56,897 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-20 14:52:56,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:56,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (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_1157) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-20 14:52:56,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-20 14:52:57,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:57,016 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-20 14:52:57,018 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-20 14:52:57,023 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-20 14:52:57,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:57,920 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-20 14:52:57,926 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-20 14:52:57,934 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-20 14:52:58,080 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-20 14:52:58,081 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-20 14:52:58,123 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-20 14:53:17,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse10 (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147))))) (.cse4 (not .cse7))) (and (or (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147))))) .cse4) (or (forall ((v_prenex_23 Int) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_arrayElimCell_68 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_68 v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_23 v_arrayElimCell_68) (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) .cse4) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (or .cse7 (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) .cse10)) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse12 (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))) .cse4) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (or (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147))))) .cse4) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_68 Int)) (or (forall ((v_prenex_23 Int)) (or (= v_prenex_23 v_arrayElimCell_68) (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_68 v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23))) (= v_arrayElimCell_68 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_68 Int)) (or (= v_prenex_23 v_arrayElimCell_68) (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_68 v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (or .cse7 (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) .cse10)) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse24 (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_61 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))) .cse4) (or .cse7 (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_prenex_23 Int) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_68 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_68) (forall ((v_prenex_23 Int)) (or (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_68 v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23))) (= v_arrayElimCell_68 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))))) (or (and (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse26 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61) (= (select (select (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) (forall ((v_ArrVal_1147 (Array Int Int))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (or (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61)))) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147))))) .cse4) (or .cse4 (forall ((v_prenex_23 Int) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_arrayElimCell_68 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_68 v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_23 v_arrayElimCell_68) (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)) (= v_arrayElimCell_68 |c_ULTIMATE.start_main_~x~0#1.base|)))) (or .cse7 (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153))) (or (= (select (select (store (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))))) (or (forall ((v_prenex_23 Int) (v_prenex_21 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= v_prenex_23 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_23 v_prenex_21) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)))) .cse7) (or .cse4 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_arrayElimCell_59 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_16| Int)) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1147))) (let ((.cse30 (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1149) v_arrayElimCell_61 v_ArrVal_1153))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1153) |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_61) (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_ArrVal_1155) v_arrayElimCell_59 v_ArrVal_1157) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (not (= (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1147 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1147)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_16| v_arrayElimCell_61))))))))) is different from false