./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:56:17,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:56:17,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:56:17,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:56:17,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:56:17,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:56:17,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:56:17,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:56:17,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:56:17,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:56:17,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:56:17,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:56:17,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:56:17,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:56:17,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:56:17,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:56:17,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:56:17,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:56:17,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:56:17,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:56:17,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:56:17,319 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:56:17,319 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:56:17,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:56:17,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:56:17,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:56:17,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:56:17,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:56:17,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:56:17,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:56:17,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:56:17,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:56:17,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:56:17,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:17,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:56:17,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:56:17,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:56:17,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:56:17,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:56:17,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:56:17,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:56:17,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:56:17,325 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-19 06:56:17,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:56:17,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:56:17,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:56:17,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:56:17,611 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:56:17,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-19 06:56:19,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:56:19,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:56:19,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-19 06:56:19,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21feeef4/abd510b76a904d9296bfda1ea9d7f8ad/FLAG9fb3dd688 [2024-11-19 06:56:19,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21feeef4/abd510b76a904d9296bfda1ea9d7f8ad [2024-11-19 06:56:19,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:56:19,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:56:19,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:19,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:56:19,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:56:19,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:19" (1/1) ... [2024-11-19 06:56:19,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea05c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:19, skipping insertion in model container [2024-11-19 06:56:19,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:19" (1/1) ... [2024-11-19 06:56:19,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:56:20,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:20,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:56:20,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:20,207 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:56:20,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20 WrapperNode [2024-11-19 06:56:20,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:20,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:20,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:56:20,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:56:20,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,249 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-11-19 06:56:20,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:20,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:56:20,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:56:20,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:56:20,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,285 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-19 06:56:20,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:56:20,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:56:20,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:56:20,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:56:20,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (1/1) ... [2024-11-19 06:56:20,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:20,355 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-19 06:56:20,358 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-19 06:56:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:56:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:56:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:56:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:56:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:56:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:56:20,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:56:20,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:56:20,885 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-19 06:56:20,885 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:56:20,906 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:56:20,906 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-19 06:56:20,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:20 BoogieIcfgContainer [2024-11-19 06:56:20,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:56:20,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:56:20,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:56:20,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:56:20,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:56:19" (1/3) ... [2024-11-19 06:56:20,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a196964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:20, skipping insertion in model container [2024-11-19 06:56:20,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:20" (2/3) ... [2024-11-19 06:56:20,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a196964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:20, skipping insertion in model container [2024-11-19 06:56:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:20" (3/3) ... [2024-11-19 06:56:20,921 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2024-11-19 06:56:20,941 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:56:20,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-19 06:56:20,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:56:21,003 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;@31632360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:56:21,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-19 06:56:21,007 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-19 06:56:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:21,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:21,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:21,015 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-19 06:56:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-19 06:56:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701263171] [2024-11-19 06:56:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,253 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-19 06:56:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701263171] [2024-11-19 06:56:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701263171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069582996] [2024-11-19 06:56:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:21,287 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-19 06:56:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:21,442 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2024-11-19 06:56:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:21,445 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-19 06:56:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:21,456 INFO L225 Difference]: With dead ends: 130 [2024-11-19 06:56:21,457 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 06:56:21,459 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-19 06:56:21,462 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-19 06:56:21,464 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-19 06:56:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 06:56:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-19 06:56:21,511 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-19 06:56:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2024-11-19 06:56:21,516 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2024-11-19 06:56:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:21,517 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2024-11-19 06:56:21,517 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-19 06:56:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-11-19 06:56:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:21,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:21,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:21,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:56:21,519 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-19 06:56:21,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-19 06:56:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747510973] [2024-11-19 06:56:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,655 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-19 06:56:21,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747510973] [2024-11-19 06:56:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747510973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821779179] [2024-11-19 06:56:21,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:21,662 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-19 06:56:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:21,794 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-19 06:56:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:21,796 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-19 06:56:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:21,798 INFO L225 Difference]: With dead ends: 125 [2024-11-19 06:56:21,798 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:56:21,798 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-19 06:56:21,799 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-19 06:56:21,802 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-19 06:56:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:56:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-19 06:56:21,813 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-19 06:56:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-19 06:56:21,817 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 3 [2024-11-19 06:56:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-19 06:56:21,818 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-19 06:56:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-19 06:56:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:56:21,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:21,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:56:21,822 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-19 06:56:21,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash 919164508, now seen corresponding path program 1 times [2024-11-19 06:56:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773020976] [2024-11-19 06:56:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:21,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773020976] [2024-11-19 06:56:21,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773020976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:21,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570558239] [2024-11-19 06:56:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:21,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:21,974 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-19 06:56:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:22,167 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-19 06:56:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:22,168 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-19 06:56:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:22,169 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:56:22,169 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:56:22,169 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-19 06:56:22,170 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-19 06:56:22,170 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-19 06:56:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:56:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:56:22,181 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-19 06:56:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-19 06:56:22,185 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 9 [2024-11-19 06:56:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:22,185 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-19 06:56:22,186 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-19 06:56:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-19 06:56:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:56:22,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:22,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:56:22,187 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-19 06:56:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 919164509, now seen corresponding path program 1 times [2024-11-19 06:56:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503849256] [2024-11-19 06:56:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:22,380 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-19 06:56:22,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503849256] [2024-11-19 06:56:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503849256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:22,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136317311] [2024-11-19 06:56:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:22,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:22,384 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-19 06:56:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:22,594 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-19 06:56:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:22,595 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-19 06:56:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:22,596 INFO L225 Difference]: With dead ends: 159 [2024-11-19 06:56:22,596 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 06:56:22,597 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-19 06:56:22,597 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-19 06:56:22,598 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-19 06:56:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 06:56:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-19 06:56:22,610 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-19 06:56:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-19 06:56:22,613 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 9 [2024-11-19 06:56:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:22,614 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-19 06:56:22,614 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-19 06:56:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-19 06:56:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:22,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:22,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:56:22,615 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-19 06:56:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-19 06:56:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704986238] [2024-11-19 06:56:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:22,782 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-19 06:56:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704986238] [2024-11-19 06:56:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704986238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586697645] [2024-11-19 06:56:22,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:22,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:22,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:22,786 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-19 06:56:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:22,960 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-19 06:56:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:22,961 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-19 06:56:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:22,963 INFO L225 Difference]: With dead ends: 148 [2024-11-19 06:56:22,963 INFO L226 Difference]: Without dead ends: 148 [2024-11-19 06:56:22,963 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-19 06:56:22,965 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:22,969 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.2s Time] [2024-11-19 06:56:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-19 06:56:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-19 06:56:22,980 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-19 06:56:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-19 06:56:22,985 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 12 [2024-11-19 06:56:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-19 06:56:22,986 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-19 06:56:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2024-11-19 06:56:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:22,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:22,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:56:22,987 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-19 06:56:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-19 06:56:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092809466] [2024-11-19 06:56:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:23,235 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-19 06:56:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092809466] [2024-11-19 06:56:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092809466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:23,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598792815] [2024-11-19 06:56:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:23,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:23,242 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-19 06:56:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:23,417 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-19 06:56:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:23,418 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-19 06:56:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:23,419 INFO L225 Difference]: With dead ends: 147 [2024-11-19 06:56:23,419 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 06:56:23,420 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-19 06:56:23,420 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-19 06:56:23,421 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-19 06:56:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 06:56:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 06:56:23,428 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-19 06:56:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-11-19 06:56:23,430 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 12 [2024-11-19 06:56:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:23,432 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-11-19 06:56:23,432 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-19 06:56:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-11-19 06:56:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:56:23,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:23,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:56:23,433 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-19 06:56:23,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash -14975914, now seen corresponding path program 1 times [2024-11-19 06:56:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142133489] [2024-11-19 06:56:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:23,539 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-19 06:56:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142133489] [2024-11-19 06:56:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142133489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461250182] [2024-11-19 06:56:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:23,542 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-19 06:56:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:23,676 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2024-11-19 06:56:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:23,677 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-19 06:56:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:23,678 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:56:23,678 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:56:23,678 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-19 06:56:23,679 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-19 06:56:23,679 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-19 06:56:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:56:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-19 06:56:23,691 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-19 06:56:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2024-11-19 06:56:23,692 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 14 [2024-11-19 06:56:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:23,692 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2024-11-19 06:56:23,693 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-19 06:56:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2024-11-19 06:56:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:56:23,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:23,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:23,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:56:23,694 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-19 06:56:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash -14975913, now seen corresponding path program 1 times [2024-11-19 06:56:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:23,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380770480] [2024-11-19 06:56:23,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:23,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:23,920 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-19 06:56:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380770480] [2024-11-19 06:56:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380770480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:23,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854439351] [2024-11-19 06:56:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:23,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:23,923 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-19 06:56:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:24,073 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2024-11-19 06:56:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:24,073 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-19 06:56:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:24,074 INFO L225 Difference]: With dead ends: 145 [2024-11-19 06:56:24,074 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 06:56:24,075 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-19 06:56:24,075 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-19 06:56:24,077 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-19 06:56:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 06:56:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-19 06:56:24,085 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-19 06:56:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-11-19 06:56:24,086 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 14 [2024-11-19 06:56:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-11-19 06:56:24,087 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-19 06:56:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-11-19 06:56:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:24,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:24,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:24,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:56:24,087 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-19 06:56:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-19 06:56:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996537273] [2024-11-19 06:56:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:24,357 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-19 06:56:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996537273] [2024-11-19 06:56:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996537273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:24,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910013308] [2024-11-19 06:56:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:24,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:56:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:56:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:24,363 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-19 06:56:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:24,694 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-19 06:56:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:24,695 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-19 06:56:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:24,696 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:56:24,696 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:56:24,697 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-19 06:56:24,697 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-19 06:56:24,698 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-19 06:56:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:56:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 06:56:24,702 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-19 06:56:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-19 06:56:24,704 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 16 [2024-11-19 06:56:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-19 06:56:24,705 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-19 06:56:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-19 06:56:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:24,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:24,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:24,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:56:24,707 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-19 06:56:24,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-19 06:56:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692248610] [2024-11-19 06:56:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:25,024 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-19 06:56:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692248610] [2024-11-19 06:56:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692248610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:56:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164452173] [2024-11-19 06:56:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:56:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:56:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:25,027 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-19 06:56:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:25,521 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2024-11-19 06:56:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:56:25,522 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-19 06:56:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:25,522 INFO L225 Difference]: With dead ends: 136 [2024-11-19 06:56:25,523 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 06:56:25,523 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-19 06:56:25,524 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-19 06:56:25,524 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-19 06:56:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 06:56:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2024-11-19 06:56:25,529 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-19 06:56:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2024-11-19 06:56:25,530 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 16 [2024-11-19 06:56:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:25,530 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2024-11-19 06:56:25,530 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-19 06:56:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2024-11-19 06:56:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:56:25,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:25,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:56:25,532 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-19 06:56:25,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 529199460, now seen corresponding path program 1 times [2024-11-19 06:56:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435684212] [2024-11-19 06:56:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:25,716 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-19 06:56:25,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:25,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435684212] [2024-11-19 06:56:25,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435684212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:25,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:25,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:56:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174289404] [2024-11-19 06:56:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:56:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:56:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:25,717 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-19 06:56:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:25,961 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2024-11-19 06:56:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:56:25,961 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-19 06:56:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:25,962 INFO L225 Difference]: With dead ends: 123 [2024-11-19 06:56:25,962 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 06:56:25,962 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-19 06:56:25,963 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-19 06:56:25,963 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-19 06:56:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 06:56:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-19 06:56:25,966 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-19 06:56:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-11-19 06:56:25,966 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 17 [2024-11-19 06:56:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:25,967 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-11-19 06:56:25,967 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-19 06:56:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-11-19 06:56:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:56:25,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:25,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:56:25,968 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-19 06:56:25,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 529199461, now seen corresponding path program 1 times [2024-11-19 06:56:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:25,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943651239] [2024-11-19 06:56:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:26,224 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-19 06:56:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943651239] [2024-11-19 06:56:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943651239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:26,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:56:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393782317] [2024-11-19 06:56:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:56:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:26,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:56:26,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:26,227 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-19 06:56:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:26,541 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-11-19 06:56:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:56:26,541 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-19 06:56:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:26,542 INFO L225 Difference]: With dead ends: 122 [2024-11-19 06:56:26,544 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 06:56:26,545 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-19 06:56:26,546 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-19 06:56:26,546 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-19 06:56:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 06:56:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-19 06:56:26,549 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-19 06:56:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-19 06:56:26,550 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 17 [2024-11-19 06:56:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:26,551 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-19 06:56:26,551 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-19 06:56:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-19 06:56:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:56:26,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:26,553 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-19 06:56:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:56:26,554 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-19 06:56:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2028654876, now seen corresponding path program 1 times [2024-11-19 06:56:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786083852] [2024-11-19 06:56:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:26,673 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-19 06:56:26,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:26,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786083852] [2024-11-19 06:56:26,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786083852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:26,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:26,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:26,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698433461] [2024-11-19 06:56:26,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:26,677 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-19 06:56:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:26,829 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-19 06:56:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:56:26,830 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-19 06:56:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:26,831 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:56:26,831 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:56:26,831 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-19 06:56:26,833 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-19 06:56:26,833 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-19 06:56:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:56:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-19 06:56:26,836 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-19 06:56:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-19 06:56:26,836 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 20 [2024-11-19 06:56:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-19 06:56:26,837 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-19 06:56:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-19 06:56:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:56:26,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:26,837 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-19 06:56:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:56:26,838 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-19 06:56:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash -187413698, now seen corresponding path program 1 times [2024-11-19 06:56:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:26,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273113467] [2024-11-19 06:56:26,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:26,893 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-19 06:56:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273113467] [2024-11-19 06:56:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273113467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:26,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411476912] [2024-11-19 06:56:26,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:26,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:26,899 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-19 06:56:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:27,003 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2024-11-19 06:56:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:27,003 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-19 06:56:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:27,004 INFO L225 Difference]: With dead ends: 142 [2024-11-19 06:56:27,005 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 06:56:27,005 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-19 06:56:27,005 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-19 06:56:27,006 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-19 06:56:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 06:56:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-19 06:56:27,008 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-19 06:56:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2024-11-19 06:56:27,009 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2024-11-19 06:56:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:27,009 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2024-11-19 06:56:27,009 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-19 06:56:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2024-11-19 06:56:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:56:27,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:27,010 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-19 06:56:27,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:56:27,011 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-19 06:56:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -555182524, now seen corresponding path program 1 times [2024-11-19 06:56:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31754804] [2024-11-19 06:56:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:27,066 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-19 06:56:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31754804] [2024-11-19 06:56:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31754804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:27,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:27,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747194741] [2024-11-19 06:56:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:27,069 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-19 06:56:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:27,175 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-19 06:56:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:27,175 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-19 06:56:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:27,176 INFO L225 Difference]: With dead ends: 115 [2024-11-19 06:56:27,176 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:56:27,176 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-19 06:56:27,177 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-19 06:56:27,177 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-19 06:56:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:56:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-19 06:56:27,180 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-19 06:56:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-19 06:56:27,180 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 27 [2024-11-19 06:56:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:27,180 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-19 06:56:27,180 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-19 06:56:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-19 06:56:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:56:27,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:27,181 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-19 06:56:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:56:27,181 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-19 06:56:27,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash -523665568, now seen corresponding path program 1 times [2024-11-19 06:56:27,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:27,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473947995] [2024-11-19 06:56:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:27,901 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-19 06:56:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473947995] [2024-11-19 06:56:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473947995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 06:56:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230346031] [2024-11-19 06:56:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:27,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:56:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:27,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:56:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:56:27,903 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-19 06:56:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:28,478 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2024-11-19 06:56:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:56:28,479 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-19 06:56:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:28,481 INFO L225 Difference]: With dead ends: 214 [2024-11-19 06:56:28,481 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 06:56:28,481 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-19 06:56:28,482 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-19 06:56:28,482 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-19 06:56:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 06:56:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-19 06:56:28,486 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-19 06:56:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-11-19 06:56:28,486 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 27 [2024-11-19 06:56:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:28,487 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-11-19 06:56:28,487 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-19 06:56:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-11-19 06:56:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:28,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:28,488 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-19 06:56:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:56:28,488 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-19 06:56:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -29938955, now seen corresponding path program 1 times [2024-11-19 06:56:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853821920] [2024-11-19 06:56:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:28,813 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-19 06:56:28,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853821920] [2024-11-19 06:56:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853821920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:56:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418099210] [2024-11-19 06:56:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:28,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:56:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:56:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:56:28,816 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-19 06:56:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:29,215 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2024-11-19 06:56:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:56:29,215 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-19 06:56:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:29,216 INFO L225 Difference]: With dead ends: 190 [2024-11-19 06:56:29,216 INFO L226 Difference]: Without dead ends: 190 [2024-11-19 06:56:29,217 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-19 06:56:29,217 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 207 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:29,217 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-19 06:56:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-19 06:56:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 139. [2024-11-19 06:56:29,220 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-19 06:56:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-11-19 06:56:29,221 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 28 [2024-11-19 06:56:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:29,221 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-11-19 06:56:29,221 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-19 06:56:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-11-19 06:56:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:29,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:29,222 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-19 06:56:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:56:29,223 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-19 06:56:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -29938954, now seen corresponding path program 1 times [2024-11-19 06:56:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756459589] [2024-11-19 06:56:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:29,660 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-19 06:56:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756459589] [2024-11-19 06:56:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756459589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:56:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746128178] [2024-11-19 06:56:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:56:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:56:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:56:29,663 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-19 06:56:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:30,136 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2024-11-19 06:56:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:56:30,137 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-19 06:56:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:30,138 INFO L225 Difference]: With dead ends: 195 [2024-11-19 06:56:30,138 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 06:56:30,138 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-19 06:56:30,139 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-19 06:56:30,139 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-19 06:56:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 06:56:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 139. [2024-11-19 06:56:30,143 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-19 06:56:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-19 06:56:30,144 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 28 [2024-11-19 06:56:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:30,144 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-19 06:56:30,144 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-19 06:56:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-19 06:56:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:30,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:30,145 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-19 06:56:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:56:30,146 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-19 06:56:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 946315059, now seen corresponding path program 1 times [2024-11-19 06:56:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450682279] [2024-11-19 06:56:30,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:30,519 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-19 06:56:30,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450682279] [2024-11-19 06:56:30,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450682279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934713917] [2024-11-19 06:56:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:30,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:30,522 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-19 06:56:30,524 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-19 06:56:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:30,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 06:56:30,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:30,822 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:56:30,824 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-19 06:56:30,919 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-19 06:56:31,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:31,029 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-19 06:56:31,100 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:31,101 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-19 06:56:31,217 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-19 06:56:31,304 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-19 06:56:31,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:31,623 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-19 06:56:31,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,652 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-19 06:56:31,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,672 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-19 06:56:31,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,694 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-19 06:56:31,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2024-11-19 06:56:32,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:32,694 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-19 06:56:34,641 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-19 06:56:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934713917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:34,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2024-11-19 06:56:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109176151] [2024-11-19 06:56:34,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:56:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:56:34,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=939, Unknown=15, NotChecked=64, Total=1190 [2024-11-19 06:56:34,647 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-19 06:56:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:35,895 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2024-11-19 06:56:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:56:35,896 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-19 06:56:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:35,896 INFO L225 Difference]: With dead ends: 192 [2024-11-19 06:56:35,897 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 06:56:35,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=1578, Unknown=16, NotChecked=84, Total=1980 [2024-11-19 06:56:35,898 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 376 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:35,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 766 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1217 Invalid, 0 Unknown, 187 Unchecked, 0.9s Time] [2024-11-19 06:56:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 06:56:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2024-11-19 06:56:35,900 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-19 06:56:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2024-11-19 06:56:35,901 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 28 [2024-11-19 06:56:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:35,901 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2024-11-19 06:56:35,901 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-19 06:56:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2024-11-19 06:56:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:35,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:35,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:35,922 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-19 06:56:36,106 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-19 06:56:36,108 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-19 06:56:36,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash 946315060, now seen corresponding path program 1 times [2024-11-19 06:56:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:36,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228362179] [2024-11-19 06:56:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:36,650 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-19 06:56:36,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:36,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228362179] [2024-11-19 06:56:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228362179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:36,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985360146] [2024-11-19 06:56:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:36,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:36,653 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-19 06:56:36,656 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-19 06:56:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:36,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 06:56:36,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:36,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:36,900 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:36,900 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-19 06:56:36,945 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-19 06:56:36,958 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-19 06:56:37,059 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:37,060 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-19 06:56:37,064 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-19 06:56:37,091 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-19 06:56:37,122 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-19 06:56:37,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:37,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-19 06:56:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:37,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:56:37,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985360146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:37,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:56:37,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2024-11-19 06:56:37,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177803513] [2024-11-19 06:56:37,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:37,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:56:37,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:56:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:56:37,257 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:37,596 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2024-11-19 06:56:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:56:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:56:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:37,598 INFO L225 Difference]: With dead ends: 165 [2024-11-19 06:56:37,598 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:56:37,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:56:37,599 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 115 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:37,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 303 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:56:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2024-11-19 06:56:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 135 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-19 06:56:37,603 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 28 [2024-11-19 06:56:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:37,603 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-19 06:56:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-19 06:56:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:56:37,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:37,604 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-19 06:56:37,621 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-19 06:56:37,808 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-19 06:56:37,809 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-19 06:56:37,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1750547211, now seen corresponding path program 1 times [2024-11-19 06:56:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489166075] [2024-11-19 06:56:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,396 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-19 06:56:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489166075] [2024-11-19 06:56:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489166075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 06:56:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696822039] [2024-11-19 06:56:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:56:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:56:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:56:38,400 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:38,872 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2024-11-19 06:56:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:56:38,872 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-19 06:56:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:38,874 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:56:38,874 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:56:38,874 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-19 06:56:38,875 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 128 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:38,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 498 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:56:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2024-11-19 06:56:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-19 06:56:38,880 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 32 [2024-11-19 06:56:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:38,881 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-19 06:56:38,881 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-19 06:56:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-19 06:56:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:56:38,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:38,882 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-19 06:56:38,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:56:38,883 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-19 06:56:38,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1143824070, now seen corresponding path program 1 times [2024-11-19 06:56:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:38,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843769109] [2024-11-19 06:56:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,962 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-19 06:56:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843769109] [2024-11-19 06:56:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843769109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134958132] [2024-11-19 06:56:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:38,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:38,964 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:39,074 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-19 06:56:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:39,074 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-19 06:56:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:39,077 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:56:39,077 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:56:39,077 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-19 06:56:39,078 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:39,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 230 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:56:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 06:56:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2024-11-19 06:56:39,081 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 38 [2024-11-19 06:56:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:39,082 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2024-11-19 06:56:39,082 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-19 06:56:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2024-11-19 06:56:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:56:39,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:39,082 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-19 06:56:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:56:39,083 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 06:56:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1904147382, now seen corresponding path program 1 times [2024-11-19 06:56:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117151701] [2024-11-19 06:56:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:39,179 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-19 06:56:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117151701] [2024-11-19 06:56:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117151701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826011277] [2024-11-19 06:56:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:39,182 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:39,318 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2024-11-19 06:56:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:39,318 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-19 06:56:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:39,319 INFO L225 Difference]: With dead ends: 149 [2024-11-19 06:56:39,319 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:56:39,319 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-19 06:56:39,321 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 82 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:39,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 112 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:56:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2024-11-19 06:56:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2024-11-19 06:56:39,324 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 37 [2024-11-19 06:56:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:39,325 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2024-11-19 06:56:39,325 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-19 06:56:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2024-11-19 06:56:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:56:39,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:39,325 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-19 06:56:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:56:39,327 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 06:56:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1143729994, now seen corresponding path program 1 times [2024-11-19 06:56:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704324493] [2024-11-19 06:56:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:39,703 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-19 06:56:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704324493] [2024-11-19 06:56:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704324493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:39,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:56:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287039738] [2024-11-19 06:56:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:39,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:56:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:56:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:56:39,706 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:40,017 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2024-11-19 06:56:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:56:40,017 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-19 06:56:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:40,018 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:56:40,018 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:56:40,018 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-19 06:56:40,019 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:40,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 313 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:56:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2024-11-19 06:56:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 146 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2024-11-19 06:56:40,023 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 38 [2024-11-19 06:56:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:40,023 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2024-11-19 06:56:40,023 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-19 06:56:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2024-11-19 06:56:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:56:40,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:40,024 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-19 06:56:40,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:56:40,024 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 06:56:40,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1682178161, now seen corresponding path program 1 times [2024-11-19 06:56:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839180334] [2024-11-19 06:56:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:40,873 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-19 06:56:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839180334] [2024-11-19 06:56:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839180334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662602721] [2024-11-19 06:56:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:40,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:40,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:40,875 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-19 06:56:40,877 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-19 06:56:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:41,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 06:56:41,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:41,026 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-19 06:56:41,038 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-19 06:56:41,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:41,097 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-19 06:56:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:41,112 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-19 06:56:41,128 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-19 06:56:41,210 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:41,210 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-19 06:56:41,218 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-19 06:56:41,245 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-19 06:56:41,273 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-19 06:56:41,324 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-19 06:56:41,357 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:56:41,358 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-19 06:56:41,371 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-19 06:56:41,383 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-19 06:56:41,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:41,495 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-19 06:56:41,500 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-19 06:56:41,527 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-19 06:56:41,536 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-19 06:56:41,562 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-19 06:56:41,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:41,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1108) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-19 06:56:41,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1108) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1109) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-19 06:56:41,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:41,702 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-19 06:56:41,705 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-19 06:56:41,711 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-19 06:56:41,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) .cse2) (or (not .cse2) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) is different from false [2024-11-19 06:56:42,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:42,574 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-19 06:56:42,580 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-19 06:56:42,588 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-19 06:56:42,738 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-19 06:56:42,738 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-19 06:56:42,768 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-19 06:56:51,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse5 (not .cse0)) (.cse16 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int)) (or (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 v_arrayElimCell_53) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse5) (or .cse0 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse5 (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10)) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_arrayElimCell_46 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse16)) (or (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0) (or (and .cse1 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse0) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_arrayElimCell_46 Int)) (or (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106))) (or (= (select (select (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) .cse10)) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106))) (or (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5) (or .cse0 (and (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int)) (or (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= v_prenex_18 v_arrayElimCell_53))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse1)) (or .cse5 (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106))) (or (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 v_arrayElimCell_53) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and .cse16 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (and .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_46 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse0) (or (and .cse10 (forall ((v_ArrVal_1100 (Array Int Int))) (or (forall ((v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1110 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1100))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) v_arrayElimCell_46 v_ArrVal_1106) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1108) v_arrayElimCell_44 v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_1100 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1100 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0)))) is different from false