./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-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:29:55,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:29:55,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:29:55,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:29:55,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:29:55,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:29:55,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:29:55,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:29:55,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:29:55,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:29:55,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:29:55,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:29:55,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:29:55,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:29:55,648 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:29:55,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:29:55,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:29:55,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:29:55,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:29:55,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:29:55,652 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:29:55,652 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:29:55,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:29:55,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:29:55,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:29:55,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:29:55,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:29:55,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:55,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:29:55,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:29:55,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:29:55,657 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2024-10-24 16:29:55,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:29:55,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:29:55,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:29:55,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:29:55,869 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:29:55,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-10-24 16:29:57,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:29:57,203 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:29:57,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-10-24 16:29:57,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5670b645b/aebc8ddffaf74e079e771be8b375d057/FLAGcc6be758a [2024-10-24 16:29:57,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5670b645b/aebc8ddffaf74e079e771be8b375d057 [2024-10-24 16:29:57,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:29:57,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:29:57,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:57,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:29:57,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:29:57,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d91748c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57, skipping insertion in model container [2024-10-24 16:29:57,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:29:57,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:57,535 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:29:57,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:57,591 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:29:57,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57 WrapperNode [2024-10-24 16:29:57,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:57,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:57,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:29:57,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:29:57,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,638 INFO L138 Inliner]: procedures = 119, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2024-10-24 16:29:57,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:57,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:29:57,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:29:57,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:29:57,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,671 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-10-24 16:29:57,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:29:57,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:29:57,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:29:57,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:29:57,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (1/1) ... [2024-10-24 16:29:57,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:57,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:29:57,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:29:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 16:29:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 16:29:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:29:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:29:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:29:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:29:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:29:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:29:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:29:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:29:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:29:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:29:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:29:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:29:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:29:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:29:57,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:29:57,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:29:57,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:29:58,136 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-24 16:29:58,136 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:29:58,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:29:58,167 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-24 16:29:58,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:58 BoogieIcfgContainer [2024-10-24 16:29:58,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:29:58,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:29:58,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:29:58,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:29:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:29:57" (1/3) ... [2024-10-24 16:29:58,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:58, skipping insertion in model container [2024-10-24 16:29:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:57" (2/3) ... [2024-10-24 16:29:58,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:58, skipping insertion in model container [2024-10-24 16:29:58,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:58" (3/3) ... [2024-10-24 16:29:58,174 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2024-10-24 16:29:58,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:29:58,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-24 16:29:58,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:29:58,225 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;@4e57e534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:29:58,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-24 16:29:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:29:58,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:58,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:29:58,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2024-10-24 16:29:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231110378] [2024-10-24 16:29:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:58,382 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-24 16:29:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231110378] [2024-10-24 16:29:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231110378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:58,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:58,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:29:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167853225] [2024-10-24 16:29:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:58,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:58,411 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-24 16:29:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:58,514 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-10-24 16:29:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:58,516 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-24 16:29:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:58,521 INFO L225 Difference]: With dead ends: 94 [2024-10-24 16:29:58,521 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 16:29:58,523 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-24 16:29:58,525 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:58,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 71 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 16:29:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 16:29:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 91 states have internal predecessors, (98), 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-24 16:29:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-10-24 16:29:58,584 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 2 [2024-10-24 16:29:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:58,584 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-10-24 16:29:58,584 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-24 16:29:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-10-24 16:29:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:29:58,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:58,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:29:58,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:29:58,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2024-10-24 16:29:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500736945] [2024-10-24 16:29:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:58,674 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-24 16:29:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500736945] [2024-10-24 16:29:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500736945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:29:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921685637] [2024-10-24 16:29:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:58,678 INFO L87 Difference]: Start difference. First operand 93 states and 101 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-24 16:29:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:58,758 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-24 16:29:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:58,759 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-24 16:29:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:58,762 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:29:58,762 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:29:58,763 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-24 16:29:58,764 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:58,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 72 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:29:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 16:29:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 2.066666666666667) internal successors, (93), 86 states have internal predecessors, (93), 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-24 16:29:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-10-24 16:29:58,772 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 2 [2024-10-24 16:29:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-10-24 16:29:58,773 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-24 16:29:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-10-24 16:29:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:58,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:58,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:29:58,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:58,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 962070555, now seen corresponding path program 1 times [2024-10-24 16:29:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336794591] [2024-10-24 16:29:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:58,860 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-24 16:29:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336794591] [2024-10-24 16:29:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336794591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:58,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:29:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933659656] [2024-10-24 16:29:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:29:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:29:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:29:58,862 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-24 16:29:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:58,977 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-10-24 16:29:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-24 16:29:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:58,979 INFO L225 Difference]: With dead ends: 76 [2024-10-24 16:29:58,979 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:29:58,980 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-24 16:29:58,980 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 97 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:58,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 49 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:29:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 16:29:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8) internal successors, (81), 74 states have internal predecessors, (81), 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-24 16:29:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-24 16:29:58,989 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 7 [2024-10-24 16:29:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:58,990 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-24 16:29:58,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-24 16:29:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-24 16:29:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:58,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:58,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:58,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:29:58,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 962070556, now seen corresponding path program 1 times [2024-10-24 16:29:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080529352] [2024-10-24 16:29:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:59,134 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-24 16:29:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:59,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080529352] [2024-10-24 16:29:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080529352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108619739] [2024-10-24 16:29:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:59,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:29:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:29:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:29:59,137 INFO L87 Difference]: Start difference. First operand 76 states and 84 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-24 16:29:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:59,250 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-24 16:29:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:29:59,250 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-24 16:29:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:59,251 INFO L225 Difference]: With dead ends: 85 [2024-10-24 16:29:59,251 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 16:29:59,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-24 16:29:59,252 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:59,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 87 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 16:29:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-10-24 16:29:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.75) internal successors, (91), 81 states have internal predecessors, (91), 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-24 16:29:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-10-24 16:29:59,262 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 7 [2024-10-24 16:29:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-10-24 16:29:59,262 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-24 16:29:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-10-24 16:29:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:59,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:59,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:29:59,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:59,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029993, now seen corresponding path program 1 times [2024-10-24 16:29:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714491132] [2024-10-24 16:29:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:59,361 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-24 16:29:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714491132] [2024-10-24 16:29:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714491132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97783441] [2024-10-24 16:29:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:59,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:59,364 INFO L87 Difference]: Start difference. First operand 83 states and 94 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-24 16:29:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:59,463 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-10-24 16:29:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:59,463 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-24 16:29:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:59,465 INFO L225 Difference]: With dead ends: 82 [2024-10-24 16:29:59,465 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 16:29:59,466 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-24 16:29:59,466 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:59,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 193 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 16:29:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 16:29:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 80 states have internal predecessors, (89), 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-24 16:29:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-10-24 16:29:59,474 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 9 [2024-10-24 16:29:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-10-24 16:29:59,474 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-24 16:29:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-10-24 16:29:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:59,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:59,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:59,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:29:59,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029994, now seen corresponding path program 1 times [2024-10-24 16:29:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539472782] [2024-10-24 16:29:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:59,701 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-24 16:29:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539472782] [2024-10-24 16:29:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539472782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215080187] [2024-10-24 16:29:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:59,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:59,705 INFO L87 Difference]: Start difference. First operand 82 states and 92 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-24 16:29:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:59,811 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-10-24 16:29:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:59,811 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-24 16:29:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:59,814 INFO L225 Difference]: With dead ends: 81 [2024-10-24 16:29:59,814 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 16:29:59,814 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-24 16:29:59,815 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:59,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 16:29:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-24 16:29:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 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-24 16:29:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-10-24 16:29:59,819 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 9 [2024-10-24 16:29:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:59,819 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-10-24 16:29:59,819 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-24 16:29:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-10-24 16:29:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:29:59,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:59,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:59,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:29:59,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:29:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1114082243, now seen corresponding path program 1 times [2024-10-24 16:29:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395501379] [2024-10-24 16:29:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:00,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395501379] [2024-10-24 16:30:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395501379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097382350] [2024-10-24 16:30:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:00,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:00,011 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-24 16:30:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:00,156 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2024-10-24 16:30:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2024-10-24 16:30:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:00,157 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:30:00,158 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:30:00,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:00,158 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 142 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:00,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 203 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:30:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2024-10-24 16:30:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 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-24 16:30:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-10-24 16:30:00,164 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 12 [2024-10-24 16:30:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:00,164 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-10-24 16:30:00,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-24 16:30:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-10-24 16:30:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:00,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:00,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:00,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:30:00,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:00,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441226, now seen corresponding path program 1 times [2024-10-24 16:30:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:00,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423375343] [2024-10-24 16:30:00,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:00,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:00,326 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-24 16:30:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423375343] [2024-10-24 16:30:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423375343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:00,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110072674] [2024-10-24 16:30:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:00,328 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:00,512 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-10-24 16:30:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:00,514 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:30:00,514 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:30:00,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:30:00,515 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:00,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 147 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:30:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2024-10-24 16:30:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 96 states have internal predecessors, (119), 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-24 16:30:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2024-10-24 16:30:00,522 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 11 [2024-10-24 16:30:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2024-10-24 16:30:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2024-10-24 16:30:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:00,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:00,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:00,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:30:00,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:00,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441227, now seen corresponding path program 1 times [2024-10-24 16:30:00,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:00,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069422733] [2024-10-24 16:30:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:00,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069422733] [2024-10-24 16:30:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069422733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341298080] [2024-10-24 16:30:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:00,753 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:00,970 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-10-24 16:30:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:00,971 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:30:00,971 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:30:00,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:00,972 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 126 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:00,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 168 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:30:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-10-24 16:30:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 100 states have internal predecessors, (117), 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-24 16:30:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2024-10-24 16:30:00,975 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 11 [2024-10-24 16:30:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2024-10-24 16:30:00,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-24 16:30:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2024-10-24 16:30:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:00,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:00,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:00,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:30:00,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278380, now seen corresponding path program 1 times [2024-10-24 16:30:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465147602] [2024-10-24 16:30:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,126 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-24 16:30:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465147602] [2024-10-24 16:30:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465147602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:01,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:30:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482393171] [2024-10-24 16:30:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:01,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:01,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:01,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:01,128 INFO L87 Difference]: Start difference. First operand 102 states and 120 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-24 16:30:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:01,300 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2024-10-24 16:30:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:30:01,301 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-24 16:30:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:01,301 INFO L225 Difference]: With dead ends: 101 [2024-10-24 16:30:01,301 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 16:30:01,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:30:01,302 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 106 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:01,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 112 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 16:30:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 16:30:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 99 states have internal predecessors, (116), 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-24 16:30:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2024-10-24 16:30:01,305 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 11 [2024-10-24 16:30:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:01,305 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2024-10-24 16:30:01,305 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-24 16:30:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2024-10-24 16:30:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:01,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:01,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:01,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:30:01,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:01,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278381, now seen corresponding path program 1 times [2024-10-24 16:30:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626049567] [2024-10-24 16:30:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,472 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-24 16:30:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626049567] [2024-10-24 16:30:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626049567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:30:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804469656] [2024-10-24 16:30:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:01,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:30:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:30:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:01,474 INFO L87 Difference]: Start difference. First operand 101 states and 119 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-24 16:30:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:01,750 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2024-10-24 16:30:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:30:01,750 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-24 16:30:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:01,751 INFO L225 Difference]: With dead ends: 95 [2024-10-24 16:30:01,751 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 16:30:01,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:30:01,751 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:01,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 150 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 16:30:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2024-10-24 16:30:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.536231884057971) internal successors, (106), 89 states have internal predecessors, (106), 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-24 16:30:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-10-24 16:30:01,754 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 11 [2024-10-24 16:30:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-10-24 16:30:01,754 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-24 16:30:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-10-24 16:30:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:30:01,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:01,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:01,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:30:01,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:01,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1165054726, now seen corresponding path program 1 times [2024-10-24 16:30:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:01,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074055879] [2024-10-24 16:30:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,944 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-24 16:30:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074055879] [2024-10-24 16:30:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074055879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214126436] [2024-10-24 16:30:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:01,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:01,946 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:02,168 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-10-24 16:30:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:30:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:02,169 INFO L225 Difference]: With dead ends: 113 [2024-10-24 16:30:02,169 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 16:30:02,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:30:02,170 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 169 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:02,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 241 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 16:30:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2024-10-24 16:30:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 92 states have internal predecessors, (111), 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-24 16:30:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2024-10-24 16:30:02,173 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 14 [2024-10-24 16:30:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2024-10-24 16:30:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2024-10-24 16:30:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:30:02,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:02,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:02,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:30:02,176 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1165054725, now seen corresponding path program 1 times [2024-10-24 16:30:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171812346] [2024-10-24 16:30:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:02,397 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-24 16:30:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171812346] [2024-10-24 16:30:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171812346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060178992] [2024-10-24 16:30:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:02,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:02,398 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:02,567 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-10-24 16:30:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:30:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:02,568 INFO L225 Difference]: With dead ends: 112 [2024-10-24 16:30:02,568 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 16:30:02,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:02,569 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:02,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 145 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 16:30:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2024-10-24 16:30:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 92 states have internal predecessors, (110), 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-24 16:30:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2024-10-24 16:30:02,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 14 [2024-10-24 16:30:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2024-10-24 16:30:02,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2024-10-24 16:30:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:30:02,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:02,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:30:02,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1631836334, now seen corresponding path program 1 times [2024-10-24 16:30:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435220759] [2024-10-24 16:30:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:02,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:02,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435220759] [2024-10-24 16:30:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435220759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:02,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:30:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135593165] [2024-10-24 16:30:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:02,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:30:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:30:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:02,684 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-24 16:30:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:02,866 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2024-10-24 16:30:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 17 [2024-10-24 16:30:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:02,867 INFO L225 Difference]: With dead ends: 112 [2024-10-24 16:30:02,867 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 16:30:02,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:30:02,867 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 87 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:02,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 245 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 16:30:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-10-24 16:30:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.5) internal successors, (123), 102 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-10-24 16:30:02,870 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 17 [2024-10-24 16:30:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:02,870 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-24 16:30:02,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-24 16:30:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-10-24 16:30:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:30:02,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:02,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:02,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:30:02,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -478805032, now seen corresponding path program 1 times [2024-10-24 16:30:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445371232] [2024-10-24 16:30:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:03,002 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-24 16:30:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445371232] [2024-10-24 16:30:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445371232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:03,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513382224] [2024-10-24 16:30:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:03,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:03,004 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:03,136 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2024-10-24 16:30:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 16:30:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:03,137 INFO L225 Difference]: With dead ends: 122 [2024-10-24 16:30:03,137 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 16:30:03,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:03,138 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 189 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:03,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 155 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 16:30:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-24 16:30:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 103 states have internal predecessors, (124), 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-24 16:30:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2024-10-24 16:30:03,140 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 17 [2024-10-24 16:30:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:03,140 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2024-10-24 16:30:03,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2024-10-24 16:30:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:03,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:03,141 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-24 16:30:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:30:03,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1957976375, now seen corresponding path program 1 times [2024-10-24 16:30:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:03,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777606092] [2024-10-24 16:30:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:03,269 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-24 16:30:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777606092] [2024-10-24 16:30:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777606092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230251355] [2024-10-24 16:30:03,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:03,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:03,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:03,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:03,270 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:03,395 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2024-10-24 16:30:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:30:03,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:03,396 INFO L225 Difference]: With dead ends: 123 [2024-10-24 16:30:03,396 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 16:30:03,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:30:03,397 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 202 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:03,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 139 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 16:30:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2024-10-24 16:30:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 104 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-24 16:30:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2024-10-24 16:30:03,399 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 18 [2024-10-24 16:30:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:03,399 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2024-10-24 16:30:03,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2024-10-24 16:30:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:30:03,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:03,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:03,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:30:03,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1993144411, now seen corresponding path program 1 times [2024-10-24 16:30:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103244954] [2024-10-24 16:30:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:03,419 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-24 16:30:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103244954] [2024-10-24 16:30:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103244954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:30:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499012865] [2024-10-24 16:30:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:30:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:30:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:30:03,420 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-24 16:30:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:03,439 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2024-10-24 16:30:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:30:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2024-10-24 16:30:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:03,455 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:30:03,455 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:30:03,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 16:30:03,456 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:03,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:30:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:30:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 16:30:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 106 states have internal predecessors, (127), 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-24 16:30:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2024-10-24 16:30:03,459 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 19 [2024-10-24 16:30:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:03,459 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2024-10-24 16:30:03,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-24 16:30:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2024-10-24 16:30:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:03,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:03,460 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-24 16:30:03,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:30:03,460 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1311265942, now seen corresponding path program 1 times [2024-10-24 16:30:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108543856] [2024-10-24 16:30:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:03,651 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-24 16:30:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108543856] [2024-10-24 16:30:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108543856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69619030] [2024-10-24 16:30:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:03,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:03,653 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:03,831 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2024-10-24 16:30:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:03,832 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:30:03,832 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:30:03,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:30:03,833 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 199 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:03,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 228 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:30:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2024-10-24 16:30:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 110 states have internal predecessors, (133), 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-24 16:30:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2024-10-24 16:30:03,835 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 18 [2024-10-24 16:30:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:03,835 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2024-10-24 16:30:03,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-24 16:30:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2024-10-24 16:30:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:03,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:03,836 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-24 16:30:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:30:03,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1311265943, now seen corresponding path program 1 times [2024-10-24 16:30:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133789641] [2024-10-24 16:30:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,045 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-24 16:30:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133789641] [2024-10-24 16:30:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133789641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931244921] [2024-10-24 16:30:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:04,047 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-24 16:30:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:04,204 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2024-10-24 16:30:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-24 16:30:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:04,205 INFO L225 Difference]: With dead ends: 124 [2024-10-24 16:30:04,205 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 16:30:04,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:04,205 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 157 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:04,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 16:30:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2024-10-24 16:30:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4666666666666666) internal successors, (132), 110 states have internal predecessors, (132), 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-24 16:30:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2024-10-24 16:30:04,207 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 18 [2024-10-24 16:30:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2024-10-24 16:30:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-24 16:30:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2024-10-24 16:30:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:30:04,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:04,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:30:04,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:04,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -570127397, now seen corresponding path program 1 times [2024-10-24 16:30:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:04,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835900501] [2024-10-24 16:30:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,339 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-24 16:30:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835900501] [2024-10-24 16:30:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835900501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:04,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:04,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479704854] [2024-10-24 16:30:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:04,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:04,340 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-24 16:30:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:04,502 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2024-10-24 16:30:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-24 16:30:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:04,503 INFO L225 Difference]: With dead ends: 126 [2024-10-24 16:30:04,503 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 16:30:04,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:04,504 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 53 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:04,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 256 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 16:30:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2024-10-24 16:30:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 108 states have internal predecessors, (129), 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-24 16:30:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2024-10-24 16:30:04,506 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 19 [2024-10-24 16:30:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2024-10-24 16:30:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-24 16:30:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2024-10-24 16:30:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:30:04,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:04,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:04,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 16:30:04,507 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1993217749, now seen corresponding path program 1 times [2024-10-24 16:30:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481685025] [2024-10-24 16:30:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,692 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-24 16:30:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481685025] [2024-10-24 16:30:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481685025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002582587] [2024-10-24 16:30:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:04,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:04,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:04,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:30:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:30:04,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:04,805 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-24 16:30:04,824 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-24 16:30:04,828 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-24 16:30:04,856 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-24 16:30:04,861 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-24 16:30:04,877 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-24 16:30:04,883 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-24 16:30:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:04,947 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-24 16:30:04,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:04,951 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-24 16:30:04,963 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 7 treesize of output 3 [2024-10-24 16:30:05,114 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:30:05,115 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-10-24 16:30:05,116 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-24 16:30:05,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:05,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (not (= v_ArrVal_566 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_566 .cse0)))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (not (= v_ArrVal_565 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_565 .cse0)))) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_565))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))) is different from false [2024-10-24 16:30:05,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_565 (Array Int Int))) (let ((.cse2 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (or (< (select (store (store .cse0 .cse1 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_75|) (not (= v_ArrVal_565 (store (store .cse3 .cse1 (select v_ArrVal_565 .cse1)) .cse2 (select v_ArrVal_565 .cse2)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_565) (select v_ArrVal_565 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_565 (Array Int Int))) (or (not (= v_ArrVal_565 (store .cse3 .cse1 (select v_ArrVal_565 .cse1)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (< (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_565) (select v_ArrVal_565 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1))))) is different from false [2024-10-24 16:30:05,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_565 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (not (= (store (store .cse0 .cse1 (select v_ArrVal_565 .cse1)) .cse2 (select v_ArrVal_565 .cse2)) v_ArrVal_565)) (< (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_565) (select v_ArrVal_565 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_559 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (or (not (= (store (store (store .cse0 .cse1 (select v_ArrVal_565 .cse1)) .cse2 (select v_ArrVal_565 .cse2)) .cse4 (select v_ArrVal_565 .cse4)) v_ArrVal_565)) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_75|) (< (select (store (store (store .cse3 .cse1 v_ArrVal_559) .cse2 v_DerPreprocessor_2) .cse4 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_565) (select v_ArrVal_565 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1)))))) is different from false [2024-10-24 16:30:05,343 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:30:05,344 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 59 treesize of output 57 [2024-10-24 16:30:05,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,358 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 22 treesize of output 20 [2024-10-24 16:30:05,387 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 23 [2024-10-24 16:30:05,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,413 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:30:05,413 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 68 treesize of output 66 [2024-10-24 16:30:05,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:05,427 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 22 treesize of output 20 [2024-10-24 16:30:05,459 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-24 16:30:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002582587] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:05,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 17 [2024-10-24 16:30:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929241974] [2024-10-24 16:30:05,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 16:30:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:05,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 16:30:05,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2024-10-24 16:30:05,461 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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-24 16:30:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:05,767 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2024-10-24 16:30:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:30:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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 19 [2024-10-24 16:30:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:05,768 INFO L225 Difference]: With dead ends: 116 [2024-10-24 16:30:05,768 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 16:30:05,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2024-10-24 16:30:05,768 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 244 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:05,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 236 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 391 Invalid, 0 Unknown, 314 Unchecked, 0.2s Time] [2024-10-24 16:30:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 16:30:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2024-10-24 16:30:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 108 states have internal predecessors, (128), 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-24 16:30:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2024-10-24 16:30:05,770 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 19 [2024-10-24 16:30:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:05,770 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2024-10-24 16:30:05,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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-24 16:30:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2024-10-24 16:30:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:30:05,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:05,771 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-24 16:30:05,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:30:05,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 16:30:05,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -887841195, now seen corresponding path program 1 times [2024-10-24 16:30:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815567002] [2024-10-24 16:30:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:05,998 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-24 16:30:05,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:05,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815567002] [2024-10-24 16:30:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815567002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:05,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:30:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960304] [2024-10-24 16:30:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:30:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:30:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:30:06,001 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 16:30:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:06,030 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2024-10-24 16:30:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:30:06,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 16:30:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:06,032 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:30:06,032 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:30:06,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 16:30:06,033 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:06,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:30:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:30:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-24 16:30:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 121 states have internal predecessors, (142), 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-24 16:30:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2024-10-24 16:30:06,036 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 20 [2024-10-24 16:30:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:06,037 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2024-10-24 16:30:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 16:30:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2024-10-24 16:30:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:30:06,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:06,038 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-24 16:30:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 16:30:06,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -419613350, now seen corresponding path program 1 times [2024-10-24 16:30:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935121280] [2024-10-24 16:30:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935121280] [2024-10-24 16:30:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935121280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:30:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129036441] [2024-10-24 16:30:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:30:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:06,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:30:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:06,263 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:06,456 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-10-24 16:30:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:30:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-24 16:30:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:06,457 INFO L225 Difference]: With dead ends: 136 [2024-10-24 16:30:06,457 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:30:06,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:30:06,458 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 129 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:06,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 299 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:30:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2024-10-24 16:30:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.396039603960396) internal successors, (141), 121 states have internal predecessors, (141), 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-24 16:30:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2024-10-24 16:30:06,461 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 20 [2024-10-24 16:30:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:06,481 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2024-10-24 16:30:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2024-10-24 16:30:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:30:06,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:06,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:06,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 16:30:06,483 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1502679585, now seen corresponding path program 1 times [2024-10-24 16:30:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862478113] [2024-10-24 16:30:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:06,797 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-24 16:30:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862478113] [2024-10-24 16:30:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862478113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:06,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:30:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806165364] [2024-10-24 16:30:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:06,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:30:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:30:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:06,799 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:07,003 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2024-10-24 16:30:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:30:07,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-24 16:30:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:07,004 INFO L225 Difference]: With dead ends: 136 [2024-10-24 16:30:07,004 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 16:30:07,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:30:07,005 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:07,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 278 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 16:30:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2024-10-24 16:30:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.411214953271028) internal successors, (151), 127 states have internal predecessors, (151), 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-24 16:30:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 154 transitions. [2024-10-24 16:30:07,010 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 154 transitions. Word has length 22 [2024-10-24 16:30:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:07,010 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 154 transitions. [2024-10-24 16:30:07,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2024-10-24 16:30:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:30:07,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:07,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:07,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:30:07,011 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:07,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:07,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2027189711, now seen corresponding path program 1 times [2024-10-24 16:30:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535163767] [2024-10-24 16:30:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:07,224 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-24 16:30:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535163767] [2024-10-24 16:30:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535163767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774786510] [2024-10-24 16:30:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:07,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:07,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:07,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:30:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:07,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 16:30:07,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:07,308 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-24 16:30:07,311 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-24 16:30:07,318 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-24 16:30:07,321 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-24 16:30:07,333 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-24 16:30:07,336 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-24 16:30:07,370 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 8 treesize of output 1 [2024-10-24 16:30:07,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:07,374 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-24 16:30:07,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:07,379 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-24 16:30:07,554 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:30:07,554 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 33 [2024-10-24 16:30:07,557 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 7 treesize of output 3 [2024-10-24 16:30:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:07,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774786510] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:07,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:30:07,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 10] total 20 [2024-10-24 16:30:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109595605] [2024-10-24 16:30:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:07,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:30:07,657 INFO L87 Difference]: Start difference. First operand 129 states and 154 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-24 16:30:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:07,768 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2024-10-24 16:30:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:07,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-24 16:30:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:07,769 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:30:07,769 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 16:30:07,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:30:07,770 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:07,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 192 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 16:30:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-10-24 16:30:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 136 states have internal predecessors, (163), 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-24 16:30:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2024-10-24 16:30:07,772 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 22 [2024-10-24 16:30:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2024-10-24 16:30:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-24 16:30:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2024-10-24 16:30:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:30:07,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:07,773 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] [2024-10-24 16:30:07,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:30:07,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-24 16:30:07,973 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:07,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -665201756, now seen corresponding path program 1 times [2024-10-24 16:30:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268498895] [2024-10-24 16:30:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,230 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-24 16:30:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268498895] [2024-10-24 16:30:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268498895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093662541] [2024-10-24 16:30:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:08,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:08,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:08,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:08,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:30:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 16:30:08,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:08,328 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-24 16:30:08,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:08,354 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-24 16:30:08,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 15 treesize of output 1 [2024-10-24 16:30:08,378 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-24 16:30:08,428 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:08,428 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-24 16:30:08,432 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-24 16:30:08,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 15 treesize of output 7 [2024-10-24 16:30:08,470 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:08,470 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 24 treesize of output 17 [2024-10-24 16:30:08,494 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-24 16:30:08,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:08,529 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 33 treesize of output 32 [2024-10-24 16:30:08,546 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 24 treesize of output 12 [2024-10-24 16:30:08,550 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-24 16:30:08,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:08,691 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_839 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_839))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse0 0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_842) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))) (forall ((v_ArrVal_838 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) (or (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_839 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_839))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_842)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (forall ((v_ArrVal_838 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2024-10-24 16:30:08,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,773 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 56 treesize of output 40 [2024-10-24 16:30:08,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,779 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 266 treesize of output 237 [2024-10-24 16:30:08,791 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 142 treesize of output 136 [2024-10-24 16:30:08,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,800 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 146 treesize of output 142 [2024-10-24 16:30:08,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,891 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 18 treesize of output 19 [2024-10-24 16:30:08,896 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 30 treesize of output 22 [2024-10-24 16:30:08,903 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 5 [2024-10-24 16:30:08,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,907 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 18 treesize of output 19 [2024-10-24 16:30:08,910 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 30 treesize of output 22 [2024-10-24 16:30:08,913 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 5 treesize of output 3 [2024-10-24 16:30:08,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-24 16:30:08,931 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-10-24 16:30:08,931 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 141 treesize of output 125 [2024-10-24 16:30:08,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:08,940 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 76 treesize of output 75 [2024-10-24 16:30:08,944 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 66 treesize of output 62 [2024-10-24 16:30:09,136 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-24 16:30:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093662541] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:09,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2024-10-24 16:30:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752008403] [2024-10-24 16:30:09,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:09,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:30:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:30:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=505, Unknown=11, NotChecked=46, Total=650 [2024-10-24 16:30:09,138 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-24 16:30:09,570 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or (forall ((v_ArrVal_842 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (and (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2024-10-24 16:30:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:09,728 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2024-10-24 16:30:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:30:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-24 16:30:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:09,729 INFO L225 Difference]: With dead ends: 213 [2024-10-24 16:30:09,729 INFO L226 Difference]: Without dead ends: 213 [2024-10-24 16:30:09,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=822, Unknown=12, NotChecked=122, Total=1122 [2024-10-24 16:30:09,730 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 188 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:09,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 497 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 878 Invalid, 0 Unknown, 208 Unchecked, 0.5s Time] [2024-10-24 16:30:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-24 16:30:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 147. [2024-10-24 16:30:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.392) internal successors, (174), 145 states have internal predecessors, (174), 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-24 16:30:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2024-10-24 16:30:09,733 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 23 [2024-10-24 16:30:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:09,733 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2024-10-24 16:30:09,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-24 16:30:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2024-10-24 16:30:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:30:09,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:09,733 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] [2024-10-24 16:30:09,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:30:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:09,934 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1822572733, now seen corresponding path program 1 times [2024-10-24 16:30:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605965518] [2024-10-24 16:30:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,156 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-24 16:30:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:10,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605965518] [2024-10-24 16:30:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605965518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:10,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088678850] [2024-10-24 16:30:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:10,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:10,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:10,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 16:30:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 16:30:10,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:10,254 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-24 16:30:10,297 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-24 16:30:10,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-24 16:30:10,321 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-24 16:30:10,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:10,399 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-24 16:30:10,439 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:10,440 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-24 16:30:10,464 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:10,464 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-24 16:30:10,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:10,510 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-24 16:30:10,532 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-24 16:30:10,567 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-24 16:30:10,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:10,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_953) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-10-24 16:30:10,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_953)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-10-24 16:30:10,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_953)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-10-24 16:30:10,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:10,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-24 16:30:10,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:10,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2024-10-24 16:30:10,640 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 80 treesize of output 76 [2024-10-24 16:30:10,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:10,649 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 76 treesize of output 74 [2024-10-24 16:30:11,343 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-24 16:30:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088678850] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:11,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 22 [2024-10-24 16:30:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936458710] [2024-10-24 16:30:11,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:11,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:30:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:30:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=317, Unknown=11, NotChecked=120, Total=552 [2024-10-24 16:30:11,344 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 16:30:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:12,135 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2024-10-24 16:30:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:30:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 22 [2024-10-24 16:30:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:12,136 INFO L225 Difference]: With dead ends: 261 [2024-10-24 16:30:12,136 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 16:30:12,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1096, Unknown=19, NotChecked=228, Total=1722 [2024-10-24 16:30:12,137 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 603 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:12,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 366 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 704 Invalid, 0 Unknown, 711 Unchecked, 0.5s Time] [2024-10-24 16:30:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 16:30:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 167. [2024-10-24 16:30:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 165 states have internal predecessors, (212), 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-24 16:30:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2024-10-24 16:30:12,140 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 22 [2024-10-24 16:30:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:12,140 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2024-10-24 16:30:12,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 16:30:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2024-10-24 16:30:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:30:12,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:12,141 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] [2024-10-24 16:30:12,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:30:12,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 16:30:12,342 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:12,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1822572732, now seen corresponding path program 1 times [2024-10-24 16:30:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517828311] [2024-10-24 16:30:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:12,721 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-24 16:30:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517828311] [2024-10-24 16:30:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517828311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813234416] [2024-10-24 16:30:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:12,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:12,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:12,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:12,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 16:30:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:12,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 16:30:12,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:12,829 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-24 16:30:12,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:12,867 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-24 16:30:12,873 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-24 16:30:12,891 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-24 16:30:12,896 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-24 16:30:12,949 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:12,950 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-24 16:30:12,958 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-24 16:30:12,988 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:12,988 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-24 16:30:12,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:12,995 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-24 16:30:13,012 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:30:13,012 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 16 treesize of output 15 [2024-10-24 16:30:13,017 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 5 treesize of output 3 [2024-10-24 16:30:13,026 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:13,026 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-24 16:30:13,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:13,072 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-24 16:30:13,076 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-24 16:30:13,094 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-24 16:30:13,096 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-24 16:30:13,108 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-24 16:30:13,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:13,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1068 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1068 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2024-10-24 16:30:13,214 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1063) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1062) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1062))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1063) .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-10-24 16:30:13,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1062))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1063) .cse1 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1063) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1062) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2024-10-24 16:30:13,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,230 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-24 16:30:13,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,234 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-24 16:30:13,243 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 54 treesize of output 46 [2024-10-24 16:30:13,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,251 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 186 treesize of output 181 [2024-10-24 16:30:13,258 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 64 treesize of output 62 [2024-10-24 16:30:13,265 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 62 treesize of output 58 [2024-10-24 16:30:13,268 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 86 treesize of output 80 [2024-10-24 16:30:13,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-24 16:30:13,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-24 16:30:13,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-10-24 16:30:13,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-24 16:30:13,330 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-24 16:30:13,420 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-24 16:30:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813234416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:13,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 25 [2024-10-24 16:30:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155691884] [2024-10-24 16:30:13,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 16:30:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 16:30:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=466, Unknown=6, NotChecked=138, Total=702 [2024-10-24 16:30:13,422 INFO L87 Difference]: Start difference. First operand 167 states and 215 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 16:30:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,975 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2024-10-24 16:30:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:30:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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 22 [2024-10-24 16:30:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,984 INFO L225 Difference]: With dead ends: 209 [2024-10-24 16:30:13,984 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 16:30:13,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=844, Unknown=6, NotChecked=192, Total=1260 [2024-10-24 16:30:13,985 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 292 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 353 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 774 Invalid, 0 Unknown, 444 Unchecked, 0.4s Time] [2024-10-24 16:30:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 16:30:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2024-10-24 16:30:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.44375) internal successors, (231), 179 states have internal predecessors, (231), 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-24 16:30:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 234 transitions. [2024-10-24 16:30:13,988 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 234 transitions. Word has length 22 [2024-10-24 16:30:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,988 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 234 transitions. [2024-10-24 16:30:13,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 16:30:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 234 transitions. [2024-10-24 16:30:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:30:13,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:14,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:30:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 16:30:14,190 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1993449013, now seen corresponding path program 1 times [2024-10-24 16:30:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955182074] [2024-10-24 16:30:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,385 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-24 16:30:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955182074] [2024-10-24 16:30:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955182074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054957870] [2024-10-24 16:30:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:14,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 16:30:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 16:30:14,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:14,487 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-24 16:30:14,500 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-24 16:30:14,506 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-24 16:30:14,523 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-24 16:30:14,530 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-24 16:30:14,537 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-24 16:30:14,543 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-24 16:30:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:14,588 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-24 16:30:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:14,592 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-24 16:30:14,719 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 19 treesize of output 7 [2024-10-24 16:30:14,769 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-10-24 16:30:14,769 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 19 [2024-10-24 16:30:14,771 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-24 16:30:14,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:14,849 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse2) |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (select (select .cse0 .cse2) |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_1134 .cse3)) v_ArrVal_1134)) (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_1133 .cse3)) v_ArrVal_1133))))) is different from false [2024-10-24 16:30:14,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_93| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse2 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_93|))) (or (< (select v_ArrVal_1133 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) (not (= (store (store .cse0 .cse1 (select v_ArrVal_1133 .cse1)) .cse2 (select v_ArrVal_1133 .cse2)) v_ArrVal_1133)) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_93|) (< |v_ULTIMATE.start_main_~x~0#1.offset_93| |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select |c_#valid| (let ((.cse4 (select v_ArrVal_1134 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1134))) (select .cse3 (select (select .cse3 .cse4) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1133) .cse4) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (not (= (store (store .cse5 .cse1 (select v_ArrVal_1134 .cse1)) .cse2 (select v_ArrVal_1134 .cse2)) v_ArrVal_1134))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (or (< (select v_ArrVal_1133 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) (= (select |c_#valid| (let ((.cse7 (select v_ArrVal_1134 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1134))) (select .cse6 (select (select .cse6 .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1133) .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (not (= v_ArrVal_1134 (store .cse5 .cse1 (select v_ArrVal_1134 .cse1)))) (not (= v_ArrVal_1133 (store .cse0 .cse1 (select v_ArrVal_1133 .cse1)))))))) is different from false [2024-10-24 16:30:14,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_93| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse5 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_93|))) (or (< (select v_ArrVal_1133 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_93|) (< |v_ULTIMATE.start_main_~x~0#1.offset_93| |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select |c_#valid| (let ((.cse1 (select v_ArrVal_1134 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1134))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1133) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (not (= v_ArrVal_1134 (store (store (store .cse2 .cse3 (select v_ArrVal_1134 .cse3)) .cse4 (select v_ArrVal_1134 .cse4)) .cse5 (select v_ArrVal_1134 .cse5)))) (not (= v_ArrVal_1133 (store (store (store .cse6 .cse3 (select v_ArrVal_1133 .cse3)) .cse4 (select v_ArrVal_1133 .cse4)) .cse5 (select v_ArrVal_1133 .cse5))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (or (< (select v_ArrVal_1133 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) (= (select |c_#valid| (let ((.cse8 (select v_ArrVal_1134 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1134))) (select .cse7 (select (select .cse7 .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1133) .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (not (= v_ArrVal_1133 (store (store .cse6 .cse3 (select v_ArrVal_1133 .cse3)) .cse4 (select v_ArrVal_1133 .cse4)))) (not (= v_ArrVal_1134 (store (store .cse2 .cse3 (select v_ArrVal_1134 .cse3)) .cse4 (select v_ArrVal_1134 .cse4)))))))) is different from false [2024-10-24 16:30:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:14,994 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 58 [2024-10-24 16:30:15,032 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-10-24 16:30:15,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 159 [2024-10-24 16:30:15,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,055 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,059 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 3987 treesize of output 3963 [2024-10-24 16:30:15,184 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 5 [2024-10-24 16:30:15,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:15,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:15,229 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 7366 treesize of output 7334 [2024-10-24 16:30:27,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:27,136 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 51 treesize of output 49 [2024-10-24 16:30:27,160 INFO L349 Elim1Store]: treesize reduction 40, result has 34.4 percent of original size [2024-10-24 16:30:27,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 144 [2024-10-24 16:30:27,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:27,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:27,172 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 144 treesize of output 138 [2024-10-24 16:30:27,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:27,191 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 24 treesize of output 28 [2024-10-24 16:30:27,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:27,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:27,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:27,209 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 644 treesize of output 638 [2024-10-24 16:30:27,366 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-24 16:30:27,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054957870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:27,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2024-10-24 16:30:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107136835] [2024-10-24 16:30:27,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:30:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:30:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2024-10-24 16:30:27,371 INFO L87 Difference]: Start difference. First operand 181 states and 234 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 16:30:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:27,732 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2024-10-24 16:30:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:27,732 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 16:30:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:27,733 INFO L225 Difference]: With dead ends: 185 [2024-10-24 16:30:27,733 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 16:30:27,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=321, Unknown=3, NotChecked=120, Total=552 [2024-10-24 16:30:27,733 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 113 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:27,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 416 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 558 Invalid, 0 Unknown, 289 Unchecked, 0.3s Time] [2024-10-24 16:30:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 16:30:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2024-10-24 16:30:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.4375) internal successors, (230), 179 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 233 transitions. [2024-10-24 16:30:27,736 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 233 transitions. Word has length 25 [2024-10-24 16:30:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 233 transitions. [2024-10-24 16:30:27,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 16:30:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 233 transitions. [2024-10-24 16:30:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:30:27,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:27,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:27,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 16:30:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 16:30:27,941 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1993449012, now seen corresponding path program 1 times [2024-10-24 16:30:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115367000] [2024-10-24 16:30:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:28,171 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-24 16:30:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:28,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115367000] [2024-10-24 16:30:28,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115367000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:28,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503571287] [2024-10-24 16:30:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:28,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:28,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:28,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:28,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 16:30:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:28,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 16:30:28,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:28,273 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-24 16:30:28,283 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-24 16:30:28,287 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-24 16:30:28,308 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-24 16:30:28,311 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-24 16:30:28,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:30:28,326 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-24 16:30:28,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:28,370 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-24 16:30:28,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:28,373 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-24 16:30:28,542 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:30:28,542 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2024-10-24 16:30:28,548 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 7 treesize of output 3 [2024-10-24 16:30:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:30:28,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:28,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1198 (Array Int Int))) (or (forall ((v_ArrVal_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1199))) (let ((.cse5 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_ArrVal_1199 (store .cse0 .cse1 (select v_ArrVal_1199 .cse1)))) (< 0 (+ 9 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1198))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (select (select .cse2 .cse4) .cse5)))))) (< .cse5 0))))) (not (= (store .cse6 .cse1 (select v_ArrVal_1198 .cse1)) v_ArrVal_1198)))) (forall ((v_ArrVal_1198 (Array Int Int))) (or (not (= (store .cse6 .cse1 (select v_ArrVal_1198 .cse1)) v_ArrVal_1198)) (forall ((v_ArrVal_1199 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1199))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_ArrVal_1199 (store .cse0 .cse1 (select v_ArrVal_1199 .cse1)))) (< .cse7 0) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1198))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse9 (select (select .cse11 .cse12) .cse7)) (.cse10 (select (select .cse8 .cse12) .cse7))) (< (+ (select (select .cse8 .cse9) .cse10) 11) (select |c_#length| (select (select .cse11 .cse9) .cse10)))))))))))))) is different from false [2024-10-24 16:30:33,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (let ((.cse0 (select v_ArrVal_1199 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse4 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (or (< .cse0 0) (not (= v_ArrVal_1198 (store (store (store .cse1 .cse2 (select v_ArrVal_1198 .cse2)) .cse3 (select v_ArrVal_1198 .cse3)) .cse4 (select v_ArrVal_1198 .cse4)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1199)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1198)) (.cse9 (select v_ArrVal_1198 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse9) .cse0)) (.cse7 (select (select .cse5 .cse9) .cse0))) (< (+ (select (select .cse5 .cse6) .cse7) 11) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= (store (store (store .cse10 .cse2 (select v_ArrVal_1199 .cse2)) .cse3 (select v_ArrVal_1199 .cse3)) .cse4 (select v_ArrVal_1199 .cse4)) v_ArrVal_1199)) (< |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (let ((.cse11 (select v_ArrVal_1199 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse14 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (or (< .cse11 0) (< 0 (+ 9 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1199)) (.cse13 (select v_ArrVal_1198 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse12 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1198) .cse13) .cse11)) (select (select .cse12 .cse13) .cse11))))) (not (= v_ArrVal_1198 (store (store (store .cse1 .cse2 (select v_ArrVal_1198 .cse2)) .cse3 (select v_ArrVal_1198 .cse3)) .cse14 (select v_ArrVal_1198 .cse14)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (not (= (store (store (store .cse10 .cse2 (select v_ArrVal_1199 .cse2)) .cse3 (select v_ArrVal_1199 .cse3)) .cse14 (select v_ArrVal_1199 .cse14)) v_ArrVal_1199)) (< |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1199 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse15 0) (not (= v_ArrVal_1199 (store (store .cse10 .cse2 (select v_ArrVal_1199 .cse2)) .cse3 (select v_ArrVal_1199 .cse3)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1199)) (.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1198)) (.cse20 (select v_ArrVal_1198 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse17 (select (select .cse19 .cse20) .cse15)) (.cse18 (select (select .cse16 .cse20) .cse15))) (< (+ (select (select .cse16 .cse17) .cse18) 11) (select |c_#length| (select (select .cse19 .cse17) .cse18))))) (not (= v_ArrVal_1198 (store (store .cse1 .cse2 (select v_ArrVal_1198 .cse2)) .cse3 (select v_ArrVal_1198 .cse3))))))) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (let ((.cse21 (select v_ArrVal_1199 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse21 0) (< 0 (+ 9 (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1199)) (.cse23 (select v_ArrVal_1198 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse22 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1198) .cse23) .cse21)) (select (select .cse22 .cse23) .cse21))))) (not (= v_ArrVal_1199 (store (store .cse10 .cse2 (select v_ArrVal_1199 .cse2)) .cse3 (select v_ArrVal_1199 .cse3)))) (not (= v_ArrVal_1198 (store (store .cse1 .cse2 (select v_ArrVal_1198 .cse2)) .cse3 (select v_ArrVal_1198 .cse3))))))))) is different from false [2024-10-24 16:30:33,127 INFO L349 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2024-10-24 16:30:33,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 324 treesize of output 318 [2024-10-24 16:30:33,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:33,172 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2024-10-24 16:30:33,172 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 372 treesize of output 366 [2024-10-24 16:30:33,262 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 1172 treesize of output 1088 [2024-10-24 16:30:33,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:33,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:33,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:33,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285033 treesize of output 282993 [2024-10-24 16:30:34,134 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-24 16:30:34,134 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 108 treesize of output 1 [2024-10-24 16:30:34,139 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-24 16:30:34,139 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 99 treesize of output 1 [2024-10-24 16:30:34,144 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-10-24 16:30:34,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 1 [2024-10-24 16:30:34,163 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-24 16:30:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503571287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:34,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:34,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 9] total 20 [2024-10-24 16:30:34,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901129270] [2024-10-24 16:30:34,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:34,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:30:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:34,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:30:34,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=8, NotChecked=74, Total=462 [2024-10-24 16:30:34,164 INFO L87 Difference]: Start difference. First operand 181 states and 233 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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-24 16:30:40,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:40,005 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2024-10-24 16:30:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:40,006 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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-24 16:30:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:40,006 INFO L225 Difference]: With dead ends: 185 [2024-10-24 16:30:40,006 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 16:30:40,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=8, NotChecked=90, Total=650 [2024-10-24 16:30:40,007 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 259 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:40,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 344 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 460 Invalid, 0 Unknown, 198 Unchecked, 1.1s Time] [2024-10-24 16:30:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 16:30:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2024-10-24 16:30:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.41875) internal successors, (227), 179 states have internal predecessors, (227), 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-24 16:30:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 230 transitions. [2024-10-24 16:30:40,010 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 230 transitions. Word has length 25 [2024-10-24 16:30:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:40,011 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 230 transitions. [2024-10-24 16:30:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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-24 16:30:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2024-10-24 16:30:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:30:40,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:40,011 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] [2024-10-24 16:30:40,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 16:30:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:40,216 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 16:30:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash 712363681, now seen corresponding path program 1 times [2024-10-24 16:30:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631772535] [2024-10-24 16:30:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:41,081 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-24 16:30:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631772535] [2024-10-24 16:30:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631772535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552185042] [2024-10-24 16:30:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:41,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:41,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 16:30:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:41,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 16:30:41,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:41,191 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-24 16:30:41,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:41,297 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-24 16:30:41,376 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-24 16:30:41,383 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-24 16:30:41,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:41,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-24 16:30:41,543 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-24 16:30:41,674 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:30:41,675 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 23 treesize of output 20 [2024-10-24 16:30:41,682 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-24 16:30:41,744 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-24 16:30:41,744 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 27 treesize of output 22 [2024-10-24 16:30:41,892 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:30:41,893 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 23 treesize of output 20 [2024-10-24 16:30:41,907 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-24 16:30:41,958 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-10-24 16:30:41,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2024-10-24 16:30:42,181 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-10-24 16:30:42,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 48 [2024-10-24 16:30:42,193 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 31 treesize of output 16 [2024-10-24 16:30:42,290 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 22 treesize of output 10 [2024-10-24 16:30:42,478 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:30:42,478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2024-10-24 16:30:42,486 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-24 16:30:42,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:42,679 INFO L349 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2024-10-24 16:30:42,679 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 20 treesize of output 19 [2024-10-24 16:30:42,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1315) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_101|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1316))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_101|) |c_ULTIMATE.start_main_~head~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 0) (not (= v_ArrVal_1316 (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_1316 .cse1))))))) is different from false [2024-10-24 16:30:43,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1315) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_101|) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_102|) (< |v_ULTIMATE.start_main_~x~0#1.offset_102| 0) (not (= v_ArrVal_1316 (let ((.cse1 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_102|))) (store (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1 (select v_ArrVal_1316 .cse1))))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1316))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_101|))))) is different from false [2024-10-24 16:30:43,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int) (v_ArrVal_1308 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1308))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1307))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1316))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_101|) |c_ULTIMATE.start_main_~head~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_102| 0) (not (= v_ArrVal_1316 (let ((.cse3 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_102|))) (store (store (select .cse1 .cse2) |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3 (select v_ArrVal_1316 .cse3))))) (< (select (select (store .cse4 .cse2 v_ArrVal_1315) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_101|) (< (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_102|))))) is different from false [2024-10-24 16:30:43,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int) (v_ArrVal_1308 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1308))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1307)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_102|) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 0) (= (select (let ((.cse1 (store .cse2 .cse3 v_ArrVal_1316))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_101|) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= v_ArrVal_1316 (let ((.cse4 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_102|))) (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4 (select v_ArrVal_1316 .cse4))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_102| 0) (< (select (select (store .cse0 .cse3 v_ArrVal_1315) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_101|)))))) is different from false [2024-10-24 16:30:43,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:43,328 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 55 treesize of output 47 [2024-10-24 16:30:43,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:43,341 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 142 treesize of output 94 [2024-10-24 16:30:43,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:43,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 2681 treesize of output 2575 [2024-10-24 16:30:44,249 INFO L349 Elim1Store]: treesize reduction 96, result has 49.5 percent of original size [2024-10-24 16:30:44,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 2134 treesize of output 1977 [2024-10-24 16:30:44,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:44,390 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 237 treesize of output 228 [2024-10-24 16:30:44,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:44,637 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 141 treesize of output 143 [2024-10-24 16:30:44,733 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 126 treesize of output 118 [2024-10-24 16:30:45,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:45,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-10-24 16:30:50,546 INFO L349 Elim1Store]: treesize reduction 24, result has 69.6 percent of original size [2024-10-24 16:30:50,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 575 treesize of output 613 [2024-10-24 16:30:53,599 INFO L349 Elim1Store]: treesize reduction 24, result has 69.6 percent of original size [2024-10-24 16:30:53,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 339 treesize of output 377 [2024-10-24 16:30:55,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:56,086 INFO L349 Elim1Store]: treesize reduction 16, result has 77.5 percent of original size [2024-10-24 16:30:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 329 [2024-10-24 16:30:57,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:57,789 INFO L349 Elim1Store]: treesize reduction 24, result has 66.2 percent of original size [2024-10-24 16:30:57,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 321 [2024-10-24 16:30:59,291 INFO L349 Elim1Store]: treesize reduction 24, result has 69.6 percent of original size [2024-10-24 16:30:59,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 305 treesize of output 343 [2024-10-24 16:31:09,561 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 1130 treesize of output 1114 [2024-10-24 16:31:11,623 INFO L349 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2024-10-24 16:31:11,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 878 treesize of output 881 [2024-10-24 16:31:13,622 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 940 treesize of output 924 [2024-10-24 16:31:23,199 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 1644 treesize of output 1626 [2024-10-24 16:31:27,719 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 5 treesize of output 3 [2024-10-24 16:31:27,957 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 5 treesize of output 3 [2024-10-24 16:31:29,053 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 5 treesize of output 3 [2024-10-24 16:31:29,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:31:29,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-10-24 16:31:29,908 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 5 treesize of output 3 [2024-10-24 16:31:30,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:31:30,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-10-24 16:31:30,104 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 5 treesize of output 3 [2024-10-24 16:31:30,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:31:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 6