./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:11:05,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:11:05,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:11:05,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:11:05,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:11:05,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:11:05,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:11:05,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:11:05,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:11:05,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:11:05,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:11:05,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:11:05,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:11:05,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:11:05,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:11:05,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:11:05,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:11:05,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:11:05,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:11:05,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:11:05,861 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:11:05,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:11:05,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:11:05,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:11:05,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:11:05,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:11:05,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:11:05,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:11:05,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:11:05,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:11:05,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:11:05,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:11:05,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:11:05,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:11:05,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:11:05,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:11:05,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:11:05,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:11:05,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:11:05,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:11:05,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:11:05,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:11:05,868 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-clean/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-clean/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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-10-11 18:11:06,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:11:06,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:11:06,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:11:06,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:11:06,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:11:06,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-10-11 18:11:07,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:11:07,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:11:07,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-10-11 18:11:07,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39937f984/19a317e29cb04aa9bd93a768e0133ed9/FLAGa88b73c37 [2024-10-11 18:11:07,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39937f984/19a317e29cb04aa9bd93a768e0133ed9 [2024-10-11 18:11:07,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:11:07,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:11:07,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:11:07,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:11:07,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:11:07,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:11:07" (1/1) ... [2024-10-11 18:11:07,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca0e572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:07, skipping insertion in model container [2024-10-11 18:11:07,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:11:07" (1/1) ... [2024-10-11 18:11:07,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:11:08,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:11:08,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:11:08,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:11:08,312 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:11:08,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08 WrapperNode [2024-10-11 18:11:08,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:11:08,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:11:08,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:11:08,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:11:08,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,370 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-10-11 18:11:08,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:11:08,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:11:08,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:11:08,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:11:08,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,423 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-10-11 18:11:08,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:11:08,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:11:08,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:11:08,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:11:08,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (1/1) ... [2024-10-11 18:11:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:11:08,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:08,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:11:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:11:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 18:11:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:11:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:11:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:11:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:11:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:11:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:11:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:11:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:11:08,697 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:11:08,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:11:09,048 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 18:11:09,048 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:11:09,081 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:11:09,081 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 18:11:09,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:11:09 BoogieIcfgContainer [2024-10-11 18:11:09,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:11:09,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:11:09,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:11:09,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:11:09,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:11:07" (1/3) ... [2024-10-11 18:11:09,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6444f8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:11:09, skipping insertion in model container [2024-10-11 18:11:09,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:11:08" (2/3) ... [2024-10-11 18:11:09,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6444f8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:11:09, skipping insertion in model container [2024-10-11 18:11:09,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:11:09" (3/3) ... [2024-10-11 18:11:09,089 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-10-11 18:11:09,102 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:11:09,102 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-11 18:11:09,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:11:09,176 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;@78d4d54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:11:09,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-11 18:11:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 18:11:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:11:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:09,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:11:09,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash 11297, now seen corresponding path program 1 times [2024-10-11 18:11:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635419722] [2024-10-11 18:11:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635419722] [2024-10-11 18:11:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635419722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:11:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274299578] [2024-10-11 18:11:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:11:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:11:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:11:09,384 INFO L87 Difference]: Start difference. First operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 18:11:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:09,508 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-10-11 18:11:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:11:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 18:11:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:09,516 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:11:09,516 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:11:09,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:11:09,520 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 104 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:09,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 83 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:11:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 18:11:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 128 states have internal predecessors, (136), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2024-10-11 18:11:09,652 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 2 [2024-10-11 18:11:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:09,652 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2024-10-11 18:11:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 18:11:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2024-10-11 18:11:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:11:09,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:09,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:11:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:11:09,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:09,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash 11298, now seen corresponding path program 1 times [2024-10-11 18:11:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14751160] [2024-10-11 18:11:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14751160] [2024-10-11 18:11:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14751160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:11:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042954244] [2024-10-11 18:11:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:11:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:11:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:11:09,732 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 18:11:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:09,855 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2024-10-11 18:11:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:11:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 18:11:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:09,857 INFO L225 Difference]: With dead ends: 132 [2024-10-11 18:11:09,857 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 18:11:09,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:11:09,858 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:09,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 95 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 18:11:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 18:11:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 130 states have internal predecessors, (138), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2024-10-11 18:11:09,866 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 2 [2024-10-11 18:11:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:09,867 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2024-10-11 18:11:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 18:11:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2024-10-11 18:11:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:11:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:09,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:11:09,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171485, now seen corresponding path program 1 times [2024-10-11 18:11:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470951214] [2024-10-11 18:11:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470951214] [2024-10-11 18:11:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470951214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:11:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730506982] [2024-10-11 18:11:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:11:10,048 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:10,202 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-10-11 18:11:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:11:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:10,204 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:11:10,204 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:11:10,204 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-10-11 18:11:10,205 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:10,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 68 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:11:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:11:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 117 states have internal predecessors, (127), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-10-11 18:11:10,218 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 7 [2024-10-11 18:11:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-10-11 18:11:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-10-11 18:11:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:11:10,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:10,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:10,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:11:10,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171486, now seen corresponding path program 1 times [2024-10-11 18:11:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114892344] [2024-10-11 18:11:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114892344] [2024-10-11 18:11:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114892344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:10,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944481556] [2024-10-11 18:11:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:10,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:11:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:11:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:11:10,452 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:10,621 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-10-11 18:11:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:10,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:11:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:10,623 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:11:10,624 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:11:10,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:11:10,626 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 228 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:10,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 100 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:11:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-10-11 18:11:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 125 states have internal predecessors, (138), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-10-11 18:11:10,640 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 7 [2024-10-11 18:11:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-10-11 18:11:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-10-11 18:11:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:11:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:10,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:11:10,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 80563974, now seen corresponding path program 1 times [2024-10-11 18:11:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527337894] [2024-10-11 18:11:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527337894] [2024-10-11 18:11:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527337894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:10,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867324883] [2024-10-11 18:11:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:10,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:10,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:10,835 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:10,976 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-10-11 18:11:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:10,977 INFO L225 Difference]: With dead ends: 126 [2024-10-11 18:11:10,977 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 18:11:10,978 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-10-11 18:11:10,978 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:10,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 298 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 18:11:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-11 18:11:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.6790123456790123) internal successors, (136), 124 states have internal predecessors, (136), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2024-10-11 18:11:10,984 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 9 [2024-10-11 18:11:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2024-10-11 18:11:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2024-10-11 18:11:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:11:10,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:10,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:10,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:11:10,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:10,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash 80563975, now seen corresponding path program 1 times [2024-10-11 18:11:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791378783] [2024-10-11 18:11:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791378783] [2024-10-11 18:11:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791378783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:11,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047556613] [2024-10-11 18:11:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:11,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:11,151 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:11,279 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2024-10-11 18:11:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:11,280 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:11:11,281 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:11:11,281 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-10-11 18:11:11,282 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:11,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:11:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-10-11 18:11:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.654320987654321) internal successors, (134), 123 states have internal predecessors, (134), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-10-11 18:11:11,286 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2024-10-11 18:11:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:11,287 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-10-11 18:11:11,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-11 18:11:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-10-11 18:11:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:11:11,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:11,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:11,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:11:11,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -108161392, now seen corresponding path program 1 times [2024-10-11 18:11:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963977504] [2024-10-11 18:11:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:11,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963977504] [2024-10-11 18:11:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963977504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:11,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:11:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127062866] [2024-10-11 18:11:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:11:11,354 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-11 18:11:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:11,454 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-10-11 18:11:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-10-11 18:11:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:11,455 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:11:11,455 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:11:11,456 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-10-11 18:11:11,457 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 109 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:11,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 151 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:11:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-10-11 18:11:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.617283950617284) internal successors, (131), 122 states have internal predecessors, (131), 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-10-11 18:11:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-10-11 18:11:11,462 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 11 [2024-10-11 18:11:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:11,462 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-10-11 18:11:11,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-11 18:11:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-10-11 18:11:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:11:11,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:11,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:11,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:11:11,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 112853709, now seen corresponding path program 1 times [2024-10-11 18:11:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:11,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295531624] [2024-10-11 18:11:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295531624] [2024-10-11 18:11:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295531624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:11,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:11:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150496536] [2024-10-11 18:11:11,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:11,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:11:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:11,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:11:11,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:11:11,626 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-11 18:11:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:11,897 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-11 18:11:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:11:11,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2024-10-11 18:11:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:11,898 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:11:11,898 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:11:11,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:11:11,899 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 127 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:11,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 203 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:11:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 18:11:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 121 states have internal predecessors, (130), 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-10-11 18:11:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2024-10-11 18:11:11,903 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 11 [2024-10-11 18:11:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2024-10-11 18:11:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-11 18:11:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2024-10-11 18:11:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:11:11,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:11,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:11,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:11:11,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:11,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash 112853710, now seen corresponding path program 1 times [2024-10-11 18:11:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166939032] [2024-10-11 18:11:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166939032] [2024-10-11 18:11:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166939032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:12,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:11:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131227153] [2024-10-11 18:11:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:11:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:12,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:11:12,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:11:12,090 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-11 18:11:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:12,472 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2024-10-11 18:11:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:11:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2024-10-11 18:11:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:12,474 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:11:12,474 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:11:12,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:11:12,475 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 167 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:12,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 258 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:11:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:11:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-10-11 18:11:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 123 states have internal predecessors, (135), 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-10-11 18:11:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-10-11 18:11:12,479 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 11 [2024-10-11 18:11:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-10-11 18:11:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-11 18:11:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-10-11 18:11:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:11:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:12,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:11:12,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1657316670, now seen corresponding path program 1 times [2024-10-11 18:11:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496019190] [2024-10-11 18:11:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496019190] [2024-10-11 18:11:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496019190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:11:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517468633] [2024-10-11 18:11:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:11:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:11:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:11:12,574 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:11:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:12,732 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2024-10-11 18:11:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:11:12,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-10-11 18:11:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:12,733 INFO L225 Difference]: With dead ends: 164 [2024-10-11 18:11:12,733 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 18:11:12,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:11:12,734 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 176 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 243 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 18:11:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2024-10-11 18:11:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 130 states have internal predecessors, (143), 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-10-11 18:11:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-10-11 18:11:12,739 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 14 [2024-10-11 18:11:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-10-11 18:11:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:11:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-10-11 18:11:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:11:12,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:12,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:11:12,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -905550920, now seen corresponding path program 1 times [2024-10-11 18:11:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774422775] [2024-10-11 18:11:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:12,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774422775] [2024-10-11 18:11:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774422775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:12,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033847285] [2024-10-11 18:11:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:12,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:12,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:12,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:12,889 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:13,010 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2024-10-11 18:11:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:11:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:13,012 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:11:13,012 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:11:13,013 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-10-11 18:11:13,013 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:13,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 274 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:11:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 18:11:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 129 states have internal predecessors, (142), 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-10-11 18:11:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-10-11 18:11:13,017 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 16 [2024-10-11 18:11:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:13,017 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-10-11 18:11:13,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-10-11 18:11:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:11:13,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:13,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:13,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:11:13,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:13,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -905550919, now seen corresponding path program 1 times [2024-10-11 18:11:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181842805] [2024-10-11 18:11:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181842805] [2024-10-11 18:11:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181842805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623295465] [2024-10-11 18:11:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:13,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:13,215 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:13,375 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-10-11 18:11:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:11:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:13,376 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:11:13,376 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:11:13,377 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-10-11 18:11:13,377 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:13,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:11:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 18:11:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.46875) internal successors, (141), 128 states have internal predecessors, (141), 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-10-11 18:11:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-10-11 18:11:13,382 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 16 [2024-10-11 18:11:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:13,383 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-10-11 18:11:13,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-10-11 18:11:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:11:13,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:13,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:11:13,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2004592475, now seen corresponding path program 1 times [2024-10-11 18:11:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127958507] [2024-10-11 18:11:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127958507] [2024-10-11 18:11:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127958507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817364761] [2024-10-11 18:11:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:11:13,513 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:13,596 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-10-11 18:11:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:13,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 18:11:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:13,598 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:11:13,598 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:11:13,598 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-10-11 18:11:13,599 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:13,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:11:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-11 18:11:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 127 states have internal predecessors, (139), 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-10-11 18:11:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2024-10-11 18:11:13,607 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 18 [2024-10-11 18:11:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:13,607 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2024-10-11 18:11:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2024-10-11 18:11:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:11:13,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:13,608 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:11:13,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1635894325, now seen corresponding path program 1 times [2024-10-11 18:11:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645396530] [2024-10-11 18:11:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645396530] [2024-10-11 18:11:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645396530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389381844] [2024-10-11 18:11:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:13,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:13,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:11:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:13,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:11:13,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:13,912 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-10-11 18:11:13,916 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-10-11 18:11:13,975 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-10-11 18:11:13,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:11:14,026 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-10-11 18:11:14,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 18:11:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:14,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:11:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 18:11:14,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:11:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389381844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:14,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:14,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-10-11 18:11:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314050704] [2024-10-11 18:11:14,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:14,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:11:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:11:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:11:14,420 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-10-11 18:11:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:14,725 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2024-10-11 18:11:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:11:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 18 [2024-10-11 18:11:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:14,727 INFO L225 Difference]: With dead ends: 162 [2024-10-11 18:11:14,727 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 18:11:14,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:11:14,728 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 164 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:14,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 331 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 18:11:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2024-10-11 18:11:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.4508196721311475) internal successors, (177), 153 states have internal predecessors, (177), 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-10-11 18:11:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2024-10-11 18:11:14,731 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 18 [2024-10-11 18:11:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:14,731 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-10-11 18:11:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-10-11 18:11:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2024-10-11 18:11:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:11:14,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:14,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:14,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:11:14,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 18:11:14,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:14,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178272, now seen corresponding path program 1 times [2024-10-11 18:11:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244432363] [2024-10-11 18:11:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244432363] [2024-10-11 18:11:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244432363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:15,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:11:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134669533] [2024-10-11 18:11:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:15,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:11:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:11:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:11:15,296 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-10-11 18:11:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:15,730 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2024-10-11 18:11:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:11:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 18 [2024-10-11 18:11:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:15,731 INFO L225 Difference]: With dead ends: 151 [2024-10-11 18:11:15,731 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 18:11:15,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:11:15,732 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 124 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:15,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:11:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 18:11:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2024-10-11 18:11:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 132 states have internal predecessors, (153), 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-10-11 18:11:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2024-10-11 18:11:15,735 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 18 [2024-10-11 18:11:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:15,736 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2024-10-11 18:11:15,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-10-11 18:11:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2024-10-11 18:11:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:11:15,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:15,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:15,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:11:15,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178271, now seen corresponding path program 1 times [2024-10-11 18:11:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740720368] [2024-10-11 18:11:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740720368] [2024-10-11 18:11:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740720368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:11:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093305675] [2024-10-11 18:11:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:11:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:11:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:11:15,874 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-10-11 18:11:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:16,015 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-10-11 18:11:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:11:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2024-10-11 18:11:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:16,016 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:11:16,016 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:11:16,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:11:16,017 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:16,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:11:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 18:11:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 131 states have internal predecessors, (152), 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-10-11 18:11:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2024-10-11 18:11:16,020 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2024-10-11 18:11:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:16,020 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2024-10-11 18:11:16,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-10-11 18:11:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2024-10-11 18:11:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:11:16,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:16,021 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-10-11 18:11:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:11:16,021 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:16,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1129137275, now seen corresponding path program 1 times [2024-10-11 18:11:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112384159] [2024-10-11 18:11:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112384159] [2024-10-11 18:11:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112384159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:11:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16648278] [2024-10-11 18:11:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:16,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:16,064 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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-10-11 18:11:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:16,157 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2024-10-11 18:11:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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-10-11 18:11:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:16,158 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:11:16,158 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:11:16,158 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-10-11 18:11:16,159 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:16,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 218 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:11:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 18:11:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.4) internal successors, (147), 128 states have internal predecessors, (147), 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-10-11 18:11:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2024-10-11 18:11:16,162 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 20 [2024-10-11 18:11:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:16,162 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2024-10-11 18:11:16,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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-10-11 18:11:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2024-10-11 18:11:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:11:16,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:16,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:16,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:11:16,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 485472380, now seen corresponding path program 1 times [2024-10-11 18:11:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573283852] [2024-10-11 18:11:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573283852] [2024-10-11 18:11:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573283852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765809370] [2024-10-11 18:11:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:11:16,299 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-11 18:11:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:16,376 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2024-10-11 18:11:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2024-10-11 18:11:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:16,377 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:11:16,378 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:11:16,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:16,378 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:16,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 192 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:11:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-10-11 18:11:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 127 states have internal predecessors, (146), 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-10-11 18:11:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2024-10-11 18:11:16,381 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 21 [2024-10-11 18:11:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2024-10-11 18:11:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-11 18:11:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2024-10-11 18:11:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:11:16,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:16,383 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] [2024-10-11 18:11:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:11:16,383 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:16,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1666643759, now seen corresponding path program 1 times [2024-10-11 18:11:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584601284] [2024-10-11 18:11:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584601284] [2024-10-11 18:11:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584601284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:11:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938091655] [2024-10-11 18:11:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:16,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:11:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:11:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:11:16,515 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-10-11 18:11:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:16,744 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2024-10-11 18:11:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:11:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 23 [2024-10-11 18:11:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:16,746 INFO L225 Difference]: With dead ends: 144 [2024-10-11 18:11:16,746 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 18:11:16,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:11:16,746 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 133 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:16,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 179 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 18:11:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-10-11 18:11:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 134 states have internal predecessors, (153), 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-10-11 18:11:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2024-10-11 18:11:16,749 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 23 [2024-10-11 18:11:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:16,749 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2024-10-11 18:11:16,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-10-11 18:11:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2024-10-11 18:11:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:11:16,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:16,750 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] [2024-10-11 18:11:16,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:11:16,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:16,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1233345126, now seen corresponding path program 1 times [2024-10-11 18:11:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199330918] [2024-10-11 18:11:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199330918] [2024-10-11 18:11:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199330918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:16,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:11:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946119466] [2024-10-11 18:11:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:16,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:11:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:11:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:11:16,774 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-11 18:11:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:16,813 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2024-10-11 18:11:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:11:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2024-10-11 18:11:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:16,814 INFO L225 Difference]: With dead ends: 140 [2024-10-11 18:11:16,818 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 18:11:16,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:11:16,819 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 46 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:16,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:11:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 18:11:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-11 18:11:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 138 states have internal predecessors, (155), 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-10-11 18:11:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2024-10-11 18:11:16,822 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 23 [2024-10-11 18:11:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:16,826 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2024-10-11 18:11:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-11 18:11:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2024-10-11 18:11:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:11:16,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:16,827 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] [2024-10-11 18:11:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:11:16,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash -166297911, now seen corresponding path program 1 times [2024-10-11 18:11:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970167023] [2024-10-11 18:11:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970167023] [2024-10-11 18:11:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970167023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211508882] [2024-10-11 18:11:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:16,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:16,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:11:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:17,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:11:17,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:17,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:11:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:17,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:11:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211508882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:17,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:11:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-11 18:11:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208194593] [2024-10-11 18:11:17,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:17,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:11:17,149 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-11 18:11:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:17,282 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-10-11 18:11:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:17,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-10-11 18:11:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:17,290 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:11:17,290 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:11:17,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:11:17,291 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:17,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 198 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:11:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-11 18:11:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 132 states have internal predecessors, (146), 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-10-11 18:11:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2024-10-11 18:11:17,298 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 25 [2024-10-11 18:11:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2024-10-11 18:11:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-11 18:11:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2024-10-11 18:11:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:11:17,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:17,300 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] [2024-10-11 18:11:17,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:11:17,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:17,508 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1792229070, now seen corresponding path program 1 times [2024-10-11 18:11:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478482843] [2024-10-11 18:11:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:17,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478482843] [2024-10-11 18:11:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478482843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889976385] [2024-10-11 18:11:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:17,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:17,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:17,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:17,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:11:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:17,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:11:17,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:17,818 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-10-11 18:11:17,823 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-10-11 18:11:17,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:11:17,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:11:17,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:17,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-11 18:11:17,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:11:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:17,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889976385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:18,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:18,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2024-10-11 18:11:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037757019] [2024-10-11 18:11:18,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:18,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:11:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:11:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:11:18,027 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-11 18:11:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:18,248 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-10-11 18:11:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:11:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 26 [2024-10-11 18:11:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:18,249 INFO L225 Difference]: With dead ends: 148 [2024-10-11 18:11:18,249 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 18:11:18,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 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-10-11 18:11:18,250 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:18,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 248 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 18:11:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2024-10-11 18:11:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 136 states have internal predecessors, (148), 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-10-11 18:11:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-10-11 18:11:18,253 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 26 [2024-10-11 18:11:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-10-11 18:11:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-11 18:11:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-10-11 18:11:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:11:18,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:18,254 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-10-11 18:11:18,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:11:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:18,459 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash -275474027, now seen corresponding path program 1 times [2024-10-11 18:11:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435106824] [2024-10-11 18:11:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435106824] [2024-10-11 18:11:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435106824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463921595] [2024-10-11 18:11:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:18,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:18,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:18,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:18,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:11:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:18,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:11:18,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:18,677 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 13 treesize of output 9 [2024-10-11 18:11:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:18,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463921595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:18,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-10-11 18:11:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328691405] [2024-10-11 18:11:18,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:11:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:18,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:11:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:18,726 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 18:11:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:18,808 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2024-10-11 18:11:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 27 [2024-10-11 18:11:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:18,810 INFO L225 Difference]: With dead ends: 145 [2024-10-11 18:11:18,810 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:11:18,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:11:18,810 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:18,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:11:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:11:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-11 18:11:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.33) internal successors, (133), 122 states have internal predecessors, (133), 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-10-11 18:11:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-10-11 18:11:18,814 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 27 [2024-10-11 18:11:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:18,814 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-10-11 18:11:18,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 18:11:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-10-11 18:11:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:11:18,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:18,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:18,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:11:19,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:11:19,015 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:19,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:19,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1073345276, now seen corresponding path program 1 times [2024-10-11 18:11:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:19,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772390574] [2024-10-11 18:11:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:19,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:19,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772390574] [2024-10-11 18:11:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772390574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:11:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688034543] [2024-10-11 18:11:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:19,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:11:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:11:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:11:19,191 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:19,390 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-10-11 18:11:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:11:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 18:11:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:19,391 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:11:19,391 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:11:19,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:11:19,392 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:19,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 347 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:11:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2024-10-11 18:11:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 114 states have internal predecessors, (125), 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-10-11 18:11:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-10-11 18:11:19,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 29 [2024-10-11 18:11:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:19,395 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-10-11 18:11:19,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-10-11 18:11:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:11:19,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:19,395 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:19,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:11:19,396 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash 59812451, now seen corresponding path program 1 times [2024-10-11 18:11:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:19,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413954710] [2024-10-11 18:11:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:19,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413954710] [2024-10-11 18:11:19,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413954710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661431451] [2024-10-11 18:11:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:19,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:19,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:11:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:11:19,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:19,893 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-10-11 18:11:19,910 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-10-11 18:11:19,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:11:19,938 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-10-11 18:11:19,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:19,954 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-10-11 18:11:19,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:11:20,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:20,011 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-10-11 18:11:20,018 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-10-11 18:11:20,038 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-10-11 18:11:20,046 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-10-11 18:11:20,063 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-10-11 18:11:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:20,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:20,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:20,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-11 18:11:20,248 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 70 treesize of output 62 [2024-10-11 18:11:20,252 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 29 treesize of output 27 [2024-10-11 18:11:20,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:20,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:20,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 133 [2024-10-11 18:11:20,445 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 232 treesize of output 220 [2024-10-11 18:11:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:11:20,454 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 8 treesize of output 4 [2024-10-11 18:11:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661431451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:23,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2024-10-11 18:11:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809527895] [2024-10-11 18:11:23,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:23,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:11:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:23,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:11:23,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=312, Unknown=38, NotChecked=0, Total=420 [2024-10-11 18:11:23,341 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-10-11 18:11:29,805 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_977) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1))) is different from false [2024-10-11 18:11:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:32,250 INFO L93 Difference]: Finished difference Result 315 states and 355 transitions. [2024-10-11 18:11:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 18:11:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 18:11:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:32,253 INFO L225 Difference]: With dead ends: 315 [2024-10-11 18:11:32,254 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 18:11:32,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=318, Invalid=1105, Unknown=63, NotChecked=74, Total=1560 [2024-10-11 18:11:32,259 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 602 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 54 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:32,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 493 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 910 Invalid, 14 Unknown, 19 Unchecked, 2.7s Time] [2024-10-11 18:11:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 18:11:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 155. [2024-10-11 18:11:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 153 states have internal predecessors, (168), 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-10-11 18:11:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-10-11 18:11:32,270 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 31 [2024-10-11 18:11:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:32,271 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-10-11 18:11:32,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-10-11 18:11:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-10-11 18:11:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:11:32,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:32,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:32,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:11:32,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:11:32,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:32,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951062, now seen corresponding path program 1 times [2024-10-11 18:11:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623309010] [2024-10-11 18:11:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623309010] [2024-10-11 18:11:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623309010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28064077] [2024-10-11 18:11:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:33,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:33,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:11:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:33,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:11:33,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:33,178 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-10-11 18:11:33,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:11:33,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:11:33,485 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-10-11 18:11:33,814 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:33,814 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-10-11 18:11:34,296 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:11:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:11:34,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:34,437 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-10-11 18:11:34,977 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-10-11 18:11:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:34,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:35,783 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-11 18:11:35,783 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 29 treesize of output 28 [2024-10-11 18:11:35,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_122| Int) (v_ArrVal_1073 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_122| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_122|) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1073))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1075)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_122|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) is different from false [2024-10-11 18:11:35,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:35,947 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 36 treesize of output 29 [2024-10-11 18:11:35,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:35,968 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 236 treesize of output 211 [2024-10-11 18:11:35,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:35,998 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 155 treesize of output 151 [2024-10-11 18:11:36,007 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 143 treesize of output 135 [2024-10-11 18:11:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28064077] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:36,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-11 18:11:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847121821] [2024-10-11 18:11:36,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:36,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:11:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:11:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=757, Unknown=7, NotChecked=56, Total=930 [2024-10-11 18:11:36,640 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 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-10-11 18:11:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:39,755 INFO L93 Difference]: Finished difference Result 216 states and 243 transitions. [2024-10-11 18:11:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:11:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 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 35 [2024-10-11 18:11:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:39,757 INFO L225 Difference]: With dead ends: 216 [2024-10-11 18:11:39,757 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 18:11:39,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=259, Invalid=1298, Unknown=7, NotChecked=76, Total=1640 [2024-10-11 18:11:39,758 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 632 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:39,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 465 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1119 Invalid, 0 Unknown, 183 Unchecked, 2.5s Time] [2024-10-11 18:11:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 18:11:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 167. [2024-10-11 18:11:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 165 states have internal predecessors, (182), 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-10-11 18:11:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2024-10-11 18:11:39,761 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 35 [2024-10-11 18:11:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2024-10-11 18:11:39,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 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-10-11 18:11:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2024-10-11 18:11:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:11:39,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:39,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:39,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:11:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:11:39,967 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951063, now seen corresponding path program 1 times [2024-10-11 18:11:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098306872] [2024-10-11 18:11:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098306872] [2024-10-11 18:11:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098306872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552727181] [2024-10-11 18:11:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:40,955 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:11:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:41,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 18:11:41,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:41,070 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-10-11 18:11:41,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:11:41,257 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-10-11 18:11:41,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:11:41,373 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-10-11 18:11:41,383 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-10-11 18:11:41,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:41,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:11:41,667 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-10-11 18:11:41,821 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:11:41,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:11:41,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:41,851 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-10-11 18:11:41,917 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:41,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:11:41,926 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-10-11 18:11:42,407 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-10-11 18:11:42,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:11:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:42,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:43,412 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int)) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int)) (or (< (+ 11 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|)))) is different from false [2024-10-11 18:11:43,715 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1173))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1174) .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|)))) is different from false [2024-10-11 18:11:43,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1173))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1174) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) is different from false [2024-10-11 18:11:43,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:43,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-11 18:11:43,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:43,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-11 18:11:43,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:43,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-10-11 18:11:43,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:43,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1070 [2024-10-11 18:11:43,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-10-11 18:11:43,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2024-10-11 18:11:43,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 491 [2024-10-11 18:11:43,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 447 [2024-10-11 18:11:44,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:44,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-11 18:11:44,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:44,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-11 18:11:44,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:44,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 18:11:44,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:44,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:44,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:44,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 18:11:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:44,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552727181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:44,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:44,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 31 [2024-10-11 18:11:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118881739] [2024-10-11 18:11:44,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:44,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:11:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:11:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=714, Unknown=6, NotChecked=168, Total=992 [2024-10-11 18:11:44,956 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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-10-11 18:11:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:48,961 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2024-10-11 18:11:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:11:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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 35 [2024-10-11 18:11:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:48,963 INFO L225 Difference]: With dead ends: 220 [2024-10-11 18:11:48,963 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 18:11:48,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=283, Invalid=1363, Unknown=6, NotChecked=240, Total=1892 [2024-10-11 18:11:48,964 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 510 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:48,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 585 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1343 Invalid, 0 Unknown, 551 Unchecked, 3.0s Time] [2024-10-11 18:11:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 18:11:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 191. [2024-10-11 18:11:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.3035714285714286) internal successors, (219), 189 states have internal predecessors, (219), 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-10-11 18:11:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 222 transitions. [2024-10-11 18:11:48,968 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 222 transitions. Word has length 35 [2024-10-11 18:11:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 222 transitions. [2024-10-11 18:11:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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-10-11 18:11:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2024-10-11 18:11:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:11:48,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:48,969 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] [2024-10-11 18:11:48,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:11:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:49,174 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:11:49,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash -875153010, now seen corresponding path program 1 times [2024-10-11 18:11:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242767103] [2024-10-11 18:11:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:50,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242767103] [2024-10-11 18:11:50,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242767103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408821935] [2024-10-11 18:11:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:50,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:50,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:11:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:50,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 18:11:50,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:50,840 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-10-11 18:11:50,890 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-10-11 18:11:51,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:11:51,050 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-10-11 18:11:51,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:51,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:11:51,172 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-10-11 18:11:51,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:51,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:11:51,473 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-10-11 18:11:51,596 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-10-11 18:11:51,637 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-10-11 18:11:51,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:11:51,712 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:11:51,712 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-10-11 18:11:51,756 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-10-11 18:11:51,761 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-10-11 18:11:51,965 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:11:51,966 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-10-11 18:11:51,978 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-10-11 18:11:51,999 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-10-11 18:11:52,015 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-10-11 18:11:52,038 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-10-11 18:11:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:52,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:52,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-11 18:11:52,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1336) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-11 18:11:52,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1336) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1337) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-11 18:11:52,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:52,404 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-10-11 18:11:52,410 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-10-11 18:11:52,416 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-10-11 18:11:52,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (not .cse0) (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (or .cse0 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1334))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1336 (Array Int Int)) (v_arrayElimCell_79 Int)) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) is different from false [2024-10-11 18:11:53,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:53,367 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 222 treesize of output 183 [2024-10-11 18:11:53,383 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 348 treesize of output 320 [2024-10-11 18:11:53,398 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 259 treesize of output 255 [2024-10-11 18:11:53,739 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2024-10-11 18:11:53,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 268 treesize of output 336 [2024-10-11 18:11:53,767 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 247 treesize of output 243 [2024-10-11 18:11:53,780 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 284 treesize of output 274 [2024-10-11 18:11:57,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse9 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) (.cse4 (not .cse3))) (and (or (and (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int) (v_arrayElimCell_87 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_11 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) .cse3) (or (forall ((v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_88 Int) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_19)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88))) .cse4) (or .cse4 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 v_arrayElimCell_87)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_81 Int) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1326 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334))) (or (= 1 (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse3 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (or (= (select (select (store (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= 1 (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse3 (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) .cse9)) (or .cse3 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334))) (or (= 1 (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_arrayElimCell_87 Int)) (or (= v_prenex_12 v_arrayElimCell_87) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_11 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))) (or .cse4 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 v_arrayElimCell_87)))) (or .cse9 .cse3) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (= v_prenex_12 v_arrayElimCell_87)))) (or .cse3 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) (or .cse4 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_81 Int) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (or (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) .cse4)))) is different from false [2024-10-11 18:12:12,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:12,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:12,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 2230 treesize of output 2582 [2024-10-11 18:12:12,816 INFO L224 Elim1Store]: Index analysis took 146 ms [2024-10-11 18:12:12,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 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 2545 treesize of output 2697 [2024-10-11 18:12:13,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 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 37759 treesize of output 37678 [2024-10-11 18:12:13,328 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 8 treesize of output 4 [2024-10-11 18:12:13,333 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 8 treesize of output 4 [2024-10-11 18:12:13,338 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 8 treesize of output 4 [2024-10-11 18:12:13,343 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 8 treesize of output 4 [2024-10-11 18:12:13,347 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 8 treesize of output 4 [2024-10-11 18:12:13,353 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 8 treesize of output 4 [2024-10-11 18:12:13,362 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 372 treesize of output 368 [2024-10-11 18:12:13,371 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 368 treesize of output 364 [2024-10-11 18:12:13,380 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 364 treesize of output 360 [2024-10-11 18:12:13,389 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 360 treesize of output 352 [2024-10-11 18:12:13,398 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 352 treesize of output 348 [2024-10-11 18:12:13,407 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 348 treesize of output 340 [2024-10-11 18:12:13,416 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 340 treesize of output 332 [2024-10-11 18:12:13,424 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 332 treesize of output 324 [2024-10-11 18:12:13,433 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 324 treesize of output 320 [2024-10-11 18:12:13,442 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 445 treesize of output 427 [2024-10-11 18:12:13,457 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 12 treesize of output 8 [2024-10-11 18:12:13,462 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 11 treesize of output 7 [2024-10-11 18:12:13,471 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 8 treesize of output 4 [2024-10-11 18:12:13,476 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 8 treesize of output 4 [2024-10-11 18:12:13,481 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 8 treesize of output 4 [2024-10-11 18:12:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408821935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:21,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 38 [2024-10-11 18:12:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12891869] [2024-10-11 18:12:21,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 18:12:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 18:12:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=908, Unknown=15, NotChecked=340, Total=1482 [2024-10-11 18:12:21,614 INFO L87 Difference]: Start difference. First operand 191 states and 222 transitions. Second operand has 39 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 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-10-11 18:12:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:29,104 INFO L93 Difference]: Finished difference Result 254 states and 293 transitions. [2024-10-11 18:12:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:12:29,105 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 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 37 [2024-10-11 18:12:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:29,106 INFO L225 Difference]: With dead ends: 254 [2024-10-11 18:12:29,106 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 18:12:29,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=458, Invalid=1803, Unknown=15, NotChecked=480, Total=2756 [2024-10-11 18:12:29,107 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 274 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 815 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:29,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 536 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1064 Invalid, 0 Unknown, 815 Unchecked, 5.0s Time] [2024-10-11 18:12:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 18:12:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 198. [2024-10-11 18:12:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 196 states have internal predecessors, (226), 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-10-11 18:12:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2024-10-11 18:12:29,111 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 37 [2024-10-11 18:12:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:29,111 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2024-10-11 18:12:29,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 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-10-11 18:12:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2024-10-11 18:12:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:12:29,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:29,112 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:29,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:12:29,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:12:29,313 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-11 18:12:29,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash -520934286, now seen corresponding path program 2 times [2024-10-11 18:12:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682843258] [2024-10-11 18:12:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682843258] [2024-10-11 18:12:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682843258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797556622] [2024-10-11 18:12:30,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:12:30,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:30,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:30,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:12:30,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:12:30,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:12:30,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 18:12:30,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:30,344 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-10-11 18:12:30,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:12:30,520 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:30,520 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-10-11 18:12:30,595 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-10-11 18:12:30,618 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-10-11 18:12:30,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:12:30,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:12:30,817 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-10-11 18:12:30,943 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-11 18:12:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2024-10-11 18:12:30,992 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-11 18:12:30,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2024-10-11 18:12:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:31,153 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:12:31,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 78 [2024-10-11 18:12:31,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2024-10-11 18:12:31,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 9 [2024-10-11 18:12:31,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:31,979 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-10-11 18:12:31,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2024-10-11 18:12:32,008 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:12:32,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 16 [2024-10-11 18:12:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:32,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:38,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:38,430 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 72 treesize of output 65 [2024-10-11 18:12:38,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:38,441 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 220 treesize of output 140 [2024-10-11 18:12:39,298 INFO L349 Elim1Store]: treesize reduction 120, result has 70.1 percent of original size [2024-10-11 18:12:39,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 12788 treesize of output 11072 [2024-10-11 18:12:39,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:39,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5863 treesize of output 5435 [2024-10-11 18:12:40,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:40,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 364 [2024-10-11 18:12:40,557 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 422 treesize of output 408