./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:45:02,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:45:02,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:45:02,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:45:02,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:45:02,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:45:02,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:45:02,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:45:02,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:45:02,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:45:02,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:45:02,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:45:02,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:45:02,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:45:02,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:45:02,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:45:02,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:45:02,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:45:02,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:45:02,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:45:02,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:45:02,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:45:02,104 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:45:02,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:45:02,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:45:02,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:45:02,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:45:02,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:45:02,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:45:02,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:45:02,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:45:02,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:45:02,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:45:02,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:45:02,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:45:02,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:45:02,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:45:02,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:45:02,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:45:02,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:45:02,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:45:02,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:45:02,112 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2024-11-09 07:45:02,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:45:02,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:45:02,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:45:02,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:45:02,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:45:02,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2024-11-09 07:45:03,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:45:03,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:45:03,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2024-11-09 07:45:03,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877956300/00d528e873df45f8a6ea8df0f7dd2c19/FLAG2264e5794 [2024-11-09 07:45:03,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877956300/00d528e873df45f8a6ea8df0f7dd2c19 [2024-11-09 07:45:03,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:45:03,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:45:03,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:45:03,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:45:03,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:45:03,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:03" (1/1) ... [2024-11-09 07:45:03,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d78e8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:03, skipping insertion in model container [2024-11-09 07:45:03,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:03" (1/1) ... [2024-11-09 07:45:03,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:45:04,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:45:04,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:45:04,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:45:04,117 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:45:04,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04 WrapperNode [2024-11-09 07:45:04,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:45:04,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:45:04,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:45:04,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:45:04,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,158 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 90 [2024-11-09 07:45:04,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:45:04,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:45:04,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:45:04,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:45:04,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,187 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-09 07:45:04,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:45:04,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:45:04,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:45:04,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:45:04,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (1/1) ... [2024-11-09 07:45:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:45:04,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:04,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:45:04,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:45:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:45:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:45:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:45:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:45:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:45:04,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:45:04,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:45:04,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:45:04,608 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-09 07:45:04,608 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:45:04,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:45:04,619 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:45:04,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:45:04 BoogieIcfgContainer [2024-11-09 07:45:04,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:45:04,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:45:04,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:45:04,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:45:04,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:45:03" (1/3) ... [2024-11-09 07:45:04,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e579d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:04, skipping insertion in model container [2024-11-09 07:45:04,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:04" (2/3) ... [2024-11-09 07:45:04,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e579d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:04, skipping insertion in model container [2024-11-09 07:45:04,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:45:04" (3/3) ... [2024-11-09 07:45:04,627 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2024-11-09 07:45:04,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:45:04,639 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-09 07:45:04,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:45:04,684 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;@4c2baaf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:45:04,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-09 07:45:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 46 states have (on average 2.130434782608696) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:45:04,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:04,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:45:04,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 28781372, now seen corresponding path program 1 times [2024-11-09 07:45:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:04,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269392944] [2024-11-09 07:45:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269392944] [2024-11-09 07:45:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269392944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:04,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:04,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710953429] [2024-11-09 07:45:04,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:04,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:45:04,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:45:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:45:04,853 INFO L87 Difference]: Start difference. First operand has 88 states, 46 states have (on average 2.130434782608696) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:04,885 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-09 07:45:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:45:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-09 07:45:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:04,897 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:45:04,897 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:45:04,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:45:04,910 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:04,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:45:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:45:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 2.0) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-09 07:45:04,938 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2024-11-09 07:45:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-09 07:45:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-09 07:45:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:45:04,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:04,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:45:04,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:45:04,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 889572136, now seen corresponding path program 1 times [2024-11-09 07:45:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229309623] [2024-11-09 07:45:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229309623] [2024-11-09 07:45:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229309623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:45:05,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565615247] [2024-11-09 07:45:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,011 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,039 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2024-11-09 07:45:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 07:45:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,042 INFO L225 Difference]: With dead ends: 134 [2024-11-09 07:45:05,042 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 07:45:05,042 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-11-09 07:45:05,043 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 07:45:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2024-11-09 07:45:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 2.028985507246377) internal successors, (140), 109 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-11-09 07:45:05,051 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 6 [2024-11-09 07:45:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-11-09 07:45:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-11-09 07:45:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:45:05,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:45:05,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2024-11-09 07:45:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533111706] [2024-11-09 07:45:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,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-11-09 07:45:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533111706] [2024-11-09 07:45:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533111706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407876596] [2024-11-09 07:45:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,128 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,215 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-11-09 07:45:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 07:45:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,216 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:45:05,216 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:45:05,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,217 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:45:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 07:45:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-11-09 07:45:05,222 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 6 [2024-11-09 07:45:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,223 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-09 07:45:05,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-11-09 07:45:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:45:05,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:45:05,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2024-11-09 07:45:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429031908] [2024-11-09 07:45:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429031908] [2024-11-09 07:45:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429031908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520560436] [2024-11-09 07:45:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,309 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,379 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2024-11-09 07:45:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 07:45:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,381 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:45:05,381 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:45:05,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,384 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:45:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-09 07:45:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 101 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2024-11-09 07:45:05,393 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 6 [2024-11-09 07:45:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,393 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2024-11-09 07:45:05,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2024-11-09 07:45:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:45:05,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:45:05,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1806931840, now seen corresponding path program 1 times [2024-11-09 07:45:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407167733] [2024-11-09 07:45:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:05,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407167733] [2024-11-09 07:45:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407167733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532499625] [2024-11-09 07:45:05,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,415 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-11-09 07:45:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,452 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-09 07:45:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:05,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-11-09 07:45:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,453 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:45:05,453 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:45:05,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,454 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:45:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 07:45:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 100 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2024-11-09 07:45:05,459 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 7 [2024-11-09 07:45:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,459 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2024-11-09 07:45:05,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-11-09 07:45:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2024-11-09 07:45:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:45:05,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:45:05,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2024-11-09 07:45:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95251443] [2024-11-09 07:45:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95251443] [2024-11-09 07:45:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95251443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:45:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991951216] [2024-11-09 07:45:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:45:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:45:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:05,718 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,803 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2024-11-09 07:45:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:45:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-09 07:45:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,804 INFO L225 Difference]: With dead ends: 98 [2024-11-09 07:45:05,804 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:45:05,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:45:05,808 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:45:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-09 07:45:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.588235294117647) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2024-11-09 07:45:05,816 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 15 [2024-11-09 07:45:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2024-11-09 07:45:05,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2024-11-09 07:45:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:45:05,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:45:05,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2024-11-09 07:45:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249877628] [2024-11-09 07:45:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:05,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:05,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249877628] [2024-11-09 07:45:05,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249877628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248158052] [2024-11-09 07:45:05,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:05,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:05,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:05,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,898 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:05,943 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-11-09 07:45:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:45:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:05,944 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:45:05,944 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:45:05,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:05,945 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:05,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:45:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 07:45:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2024-11-09 07:45:05,954 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 16 [2024-11-09 07:45:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:05,954 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2024-11-09 07:45:05,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2024-11-09 07:45:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:45:05,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:05,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:05,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:45:05,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2024-11-09 07:45:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850605889] [2024-11-09 07:45:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:06,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850605889] [2024-11-09 07:45:06,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850605889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:06,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:06,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:45:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869089935] [2024-11-09 07:45:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:45:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:06,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:45:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:06,039 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:06,073 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 07:45:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:45:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:45:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:06,074 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:45:06,074 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:45:06,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:45:06,074 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:06,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:45:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 07:45:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-09 07:45:06,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2024-11-09 07:45:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:06,078 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-09 07:45:06,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-09 07:45:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:45:06,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:06,079 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:45:06,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash -796866651, now seen corresponding path program 1 times [2024-11-09 07:45:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054486638] [2024-11-09 07:45:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:06,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054486638] [2024-11-09 07:45:06,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054486638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:06,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:06,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:45:06,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123630522] [2024-11-09 07:45:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:45:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:45:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:45:06,123 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:06,207 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-09 07:45:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:45:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:06,208 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:45:06,208 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:45:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:06,209 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 93 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:45:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 07:45:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-09 07:45:06,215 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 19 [2024-11-09 07:45:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:06,215 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-09 07:45:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-09 07:45:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:45:06,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:06,217 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:06,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:45:06,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:06,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash -796866650, now seen corresponding path program 1 times [2024-11-09 07:45:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018816435] [2024-11-09 07:45:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018816435] [2024-11-09 07:45:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018816435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:06,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:06,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:45:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124393773] [2024-11-09 07:45:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:06,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:45:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:45:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:45:06,327 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:06,404 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2024-11-09 07:45:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:45:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:06,405 INFO L225 Difference]: With dead ends: 118 [2024-11-09 07:45:06,405 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 07:45:06,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:06,405 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:06,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 07:45:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2024-11-09 07:45:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.372340425531915) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-09 07:45:06,408 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 19 [2024-11-09 07:45:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:06,408 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-09 07:45:06,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-09 07:45:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-09 07:45:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:45:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:06,409 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-11-09 07:45:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:45:06,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:06,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2024-11-09 07:45:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662820996] [2024-11-09 07:45:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:06,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662820996] [2024-11-09 07:45:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662820996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:06,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:45:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479871322] [2024-11-09 07:45:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:45:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:45:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:45:06,563 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 07:45:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:06,668 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-11-09 07:45:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:45:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 07:45:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:06,669 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:45:06,669 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:45:06,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:45:06,670 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:06,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 186 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:45:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2024-11-09 07:45:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.349056603773585) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2024-11-09 07:45:06,673 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 19 [2024-11-09 07:45:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2024-11-09 07:45:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-09 07:45:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2024-11-09 07:45:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:45:06,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:06,675 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-11-09 07:45:06,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:45:06,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:06,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2024-11-09 07:45:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166772047] [2024-11-09 07:45:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166772047] [2024-11-09 07:45:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166772047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:45:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350833850] [2024-11-09 07:45:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:45:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:45:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:45:07,064 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-11-09 07:45:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:07,271 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-11-09 07:45:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:45:07,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-11-09 07:45:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:07,272 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:45:07,272 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:45:07,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:45:07,273 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 97 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:07,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 226 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:45:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2024-11-09 07:45:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.330188679245283) internal successors, (141), 122 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2024-11-09 07:45:07,277 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 19 [2024-11-09 07:45:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:07,278 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2024-11-09 07:45:07,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-11-09 07:45:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2024-11-09 07:45:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:45:07,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:07,280 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:07,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:45:07,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1066936995, now seen corresponding path program 1 times [2024-11-09 07:45:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:07,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680150143] [2024-11-09 07:45:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680150143] [2024-11-09 07:45:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680150143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:07,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:07,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:45:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010419236] [2024-11-09 07:45:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:45:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:45:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:45:07,323 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-11-09 07:45:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:07,366 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2024-11-09 07:45:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:45:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-11-09 07:45:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:07,367 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:45:07,367 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:45:07,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:07,368 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:07,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 139 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:45:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-09 07:45:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 121 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-09 07:45:07,371 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 20 [2024-11-09 07:45:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:07,371 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-09 07:45:07,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-09 07:45:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:45:07,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:07,372 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] [2024-11-09 07:45:07,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:45:07,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:07,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1284670490, now seen corresponding path program 1 times [2024-11-09 07:45:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384318738] [2024-11-09 07:45:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:45:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384318738] [2024-11-09 07:45:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384318738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:45:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068059427] [2024-11-09 07:45:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:45:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:45:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:45:07,408 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-11-09 07:45:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:07,471 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-09 07:45:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:45:07,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 21 [2024-11-09 07:45:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:07,471 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:45:07,471 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:45:07,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:45:07,472 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:07,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:45:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2024-11-09 07:45:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 124 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-11-09 07:45:07,475 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 21 [2024-11-09 07:45:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:07,476 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-11-09 07:45:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-11-09 07:45:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-11-09 07:45:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:45:07,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:07,476 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] [2024-11-09 07:45:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:45:07,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:07,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1284670489, now seen corresponding path program 1 times [2024-11-09 07:45:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:07,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807554231] [2024-11-09 07:45:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807554231] [2024-11-09 07:45:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807554231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:45:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811232281] [2024-11-09 07:45:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:07,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:45:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:45:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:07,561 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:07,690 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2024-11-09 07:45:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:45:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 07:45:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:07,692 INFO L225 Difference]: With dead ends: 150 [2024-11-09 07:45:07,692 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 07:45:07,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:45:07,693 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:07,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 07:45:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2024-11-09 07:45:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.322314049586777) internal successors, (160), 136 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2024-11-09 07:45:07,697 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2024-11-09 07:45:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2024-11-09 07:45:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2024-11-09 07:45:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:45:07,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:07,700 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] [2024-11-09 07:45:07,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:45:07,700 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:07,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash 835086795, now seen corresponding path program 1 times [2024-11-09 07:45:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104103519] [2024-11-09 07:45:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104103519] [2024-11-09 07:45:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104103519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:45:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907150865] [2024-11-09 07:45:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:07,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:45:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:45:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:45:07,896 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:08,009 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2024-11-09 07:45:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:45:08,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-09 07:45:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:08,010 INFO L225 Difference]: With dead ends: 155 [2024-11-09 07:45:08,011 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 07:45:08,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:45:08,011 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:08,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 254 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 07:45:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2024-11-09 07:45:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2024-11-09 07:45:08,014 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 24 [2024-11-09 07:45:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:08,014 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2024-11-09 07:45:08,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2024-11-09 07:45:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:45:08,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:08,015 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-11-09 07:45:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:45:08,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 117885485, now seen corresponding path program 1 times [2024-11-09 07:45:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152971971] [2024-11-09 07:45:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152971971] [2024-11-09 07:45:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152971971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:08,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:45:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538261404] [2024-11-09 07:45:08,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:08,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:45:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:45:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:08,065 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:08,151 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-11-09 07:45:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:45:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:45:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:08,152 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:45:08,152 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:45:08,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:45:08,152 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 185 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:45:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2024-11-09 07:45:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 159 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2024-11-09 07:45:08,155 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 25 [2024-11-09 07:45:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:08,155 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2024-11-09 07:45:08,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2024-11-09 07:45:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:45:08,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:08,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:45:08,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1356598818, now seen corresponding path program 1 times [2024-11-09 07:45:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222610818] [2024-11-09 07:45:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222610818] [2024-11-09 07:45:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222610818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544128450] [2024-11-09 07:45:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:08,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:08,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:45:08,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:45:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:08,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:45:08,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:08,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:45:08,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:45:08,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:45:08,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:45:08,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 19 treesize of output 18 [2024-11-09 07:45:08,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:45:08,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:45:08,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:45:08,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:45:08,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:45:08,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:45:08,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:45:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:08,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544128450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:08,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:08,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 12 [2024-11-09 07:45:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155211268] [2024-11-09 07:45:08,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:45:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:08,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:45:08,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:45:08,902 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:09,161 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2024-11-09 07:45:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:45:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:45:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:09,162 INFO L225 Difference]: With dead ends: 186 [2024-11-09 07:45:09,162 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 07:45:09,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:45:09,162 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:09,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 414 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 07:45:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2024-11-09 07:45:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.337837837837838) internal successors, (198), 163 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2024-11-09 07:45:09,165 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 28 [2024-11-09 07:45:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2024-11-09 07:45:09,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2024-11-09 07:45:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:45:09,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:09,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:09,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:45:09,369 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,SelfDestructingSolverStorable17 [2024-11-09 07:45:09,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1346664678, now seen corresponding path program 1 times [2024-11-09 07:45:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510392547] [2024-11-09 07:45:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:09,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510392547] [2024-11-09 07:45:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510392547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234194786] [2024-11-09 07:45:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:09,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:09,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:09,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:45:09,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:45:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:09,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:45:09,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:09,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:09,567 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:45:09,568 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 19 treesize of output 16 [2024-11-09 07:45:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:09,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234194786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:09,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:09,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2024-11-09 07:45:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648033500] [2024-11-09 07:45:09,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:09,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:45:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:45:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:45:09,724 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:09,830 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2024-11-09 07:45:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:45:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:45:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:09,831 INFO L225 Difference]: With dead ends: 184 [2024-11-09 07:45:09,831 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:45:09,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:45:09,832 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 89 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:09,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 146 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:45:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2024-11-09 07:45:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2024-11-09 07:45:09,835 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 28 [2024-11-09 07:45:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:09,835 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2024-11-09 07:45:09,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2024-11-09 07:45:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:45:09,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:09,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:09,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:45:10,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:10,037 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1346664677, now seen corresponding path program 1 times [2024-11-09 07:45:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167454406] [2024-11-09 07:45:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167454406] [2024-11-09 07:45:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167454406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130145209] [2024-11-09 07:45:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:10,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:10,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:10,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:45:10,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:45:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:10,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:45:10,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:10,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-11-09 07:45:10,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:10,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 07:45:10,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:45:10,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:45:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:10,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130145209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:10,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:10,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 07:45:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546264558] [2024-11-09 07:45:10,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:45:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:45:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:45:10,637 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:10,779 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2024-11-09 07:45:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:45:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:45:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:10,780 INFO L225 Difference]: With dead ends: 183 [2024-11-09 07:45:10,780 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 07:45:10,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:45:10,781 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 140 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:10,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 138 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 07:45:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2024-11-09 07:45:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 161 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2024-11-09 07:45:10,784 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 28 [2024-11-09 07:45:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:10,785 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2024-11-09 07:45:10,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2024-11-09 07:45:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:45:10,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:10,785 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:10,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:45:10,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:10,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:10,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 895109002, now seen corresponding path program 1 times [2024-11-09 07:45:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133669133] [2024-11-09 07:45:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133669133] [2024-11-09 07:45:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133669133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448395552] [2024-11-09 07:45:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:11,073 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-11-09 07:45:11,074 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-11-09 07:45:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:11,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:45:11,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:45:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:11,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:11,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_47| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_47|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_47| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-09 07:45:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:45:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448395552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:11,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2024-11-09 07:45:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959087117] [2024-11-09 07:45:11,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:11,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:45:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:11,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:45:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:45:11,243 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:11,354 INFO L93 Difference]: Finished difference Result 164 states and 195 transitions. [2024-11-09 07:45:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:45:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 29 [2024-11-09 07:45:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:11,355 INFO L225 Difference]: With dead ends: 164 [2024-11-09 07:45:11,355 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:45:11,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-09 07:45:11,356 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:11,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 193 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2024-11-09 07:45:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:45:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 07:45:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.326086956521739) internal successors, (183), 151 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-11-09 07:45:11,359 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 183 transitions. Word has length 29 [2024-11-09 07:45:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:11,359 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-09 07:45:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 183 transitions. [2024-11-09 07:45:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:45:11,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:11,360 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:11,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:45:11,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:11,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash -815532581, now seen corresponding path program 1 times [2024-11-09 07:45:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442417609] [2024-11-09 07:45:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442417609] [2024-11-09 07:45:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442417609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796739885] [2024-11-09 07:45:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:11,889 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-11-09 07:45:11,890 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-11-09 07:45:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:11,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:45:11,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:11,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:11,997 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-11-09 07:45:12,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:12,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 07:45:12,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:45:12,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:45:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:12,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796739885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:12,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-09 07:45:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845030672] [2024-11-09 07:45:12,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:45:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:12,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:45:12,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:45:12,257 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. Second operand has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:12,566 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2024-11-09 07:45:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:45:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 32 [2024-11-09 07:45:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:12,568 INFO L225 Difference]: With dead ends: 182 [2024-11-09 07:45:12,568 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 07:45:12,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:45:12,568 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 79 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:12,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 243 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:45:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 07:45:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2024-11-09 07:45:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 169 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2024-11-09 07:45:12,571 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 32 [2024-11-09 07:45:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:12,571 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2024-11-09 07:45:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2024-11-09 07:45:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:45:12,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:12,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:12,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:45:12,772 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,SelfDestructingSolverStorable21 [2024-11-09 07:45:12,772 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2024-11-09 07:45:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:12,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160998609] [2024-11-09 07:45:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160998609] [2024-11-09 07:45:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160998609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586831740] [2024-11-09 07:45:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:12,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:12,942 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-11-09 07:45:12,943 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-11-09 07:45:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:13,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:45:13,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:13,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:45:13,078 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 07:45:13,079 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 23 treesize of output 24 [2024-11-09 07:45:13,117 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:45:13,118 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-11-09 07:45:13,145 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:45:13,145 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 36 treesize of output 16 [2024-11-09 07:45:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:13,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586831740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:13,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 07:45:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582839610] [2024-11-09 07:45:13,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:13,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:45:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:45:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:45:13,235 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:13,426 INFO L93 Difference]: Finished difference Result 169 states and 201 transitions. [2024-11-09 07:45:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:45:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 32 [2024-11-09 07:45:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:13,427 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:45:13,427 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:45:13,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:45:13,428 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:13,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 283 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:45:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-09 07:45:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 156 states have (on average 1.2884615384615385) internal successors, (201), 168 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2024-11-09 07:45:13,431 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 32 [2024-11-09 07:45:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:13,431 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2024-11-09 07:45:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2024-11-09 07:45:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:45:13,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:13,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:13,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:45:13,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:13,638 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2024-11-09 07:45:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980404628] [2024-11-09 07:45:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980404628] [2024-11-09 07:45:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980404628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591869409] [2024-11-09 07:45:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:13,893 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-11-09 07:45:13,894 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-11-09 07:45:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:14,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:45:14,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:14,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:14,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:45:14,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:45:14,093 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 07:45:14,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2024-11-09 07:45:14,157 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:45:14,157 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 25 treesize of output 20 [2024-11-09 07:45:14,169 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:45:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:45:14,230 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:45:14,231 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 28 treesize of output 12 [2024-11-09 07:45:14,237 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:45:14,237 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 15 treesize of output 7 [2024-11-09 07:45:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:14,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591869409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:14,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:14,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-09 07:45:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850854899] [2024-11-09 07:45:14,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:14,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:45:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:45:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:45:14,417 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:14,728 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2024-11-09 07:45:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:45:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 32 [2024-11-09 07:45:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:14,729 INFO L225 Difference]: With dead ends: 178 [2024-11-09 07:45:14,729 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 07:45:14,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:45:14,730 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:14,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 321 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:45:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 07:45:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2024-11-09 07:45:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.295774647887324) internal successors, (184), 153 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2024-11-09 07:45:14,733 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 32 [2024-11-09 07:45:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2024-11-09 07:45:14,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2024-11-09 07:45:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:45:14,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:14,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:14,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:45:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:14,938 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2042760996, now seen corresponding path program 1 times [2024-11-09 07:45:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446311119] [2024-11-09 07:45:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446311119] [2024-11-09 07:45:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446311119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:15,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061192296] [2024-11-09 07:45:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:15,249 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-11-09 07:45:15,250 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-11-09 07:45:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:15,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:45:15,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:45:15,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:45:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061192296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:45:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 07:45:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036027697] [2024-11-09 07:45:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:15,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:45:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:45:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:45:15,424 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:15,499 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2024-11-09 07:45:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:45:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2024-11-09 07:45:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:15,501 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:45:15,501 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 07:45:15,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:45:15,502 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:15,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 07:45:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2024-11-09 07:45:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2024-11-09 07:45:15,505 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 34 [2024-11-09 07:45:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2024-11-09 07:45:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2024-11-09 07:45:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:45:15,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:15,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:15,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:45:15,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:45:15,706 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:15,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash -501164924, now seen corresponding path program 1 times [2024-11-09 07:45:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412147277] [2024-11-09 07:45:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:45:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412147277] [2024-11-09 07:45:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412147277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:45:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481254757] [2024-11-09 07:45:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:45:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:45:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:45:15,753 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:15,797 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2024-11-09 07:45:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:45:15,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:45:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:15,797 INFO L225 Difference]: With dead ends: 160 [2024-11-09 07:45:15,797 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 07:45:15,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:45:15,798 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:15,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 126 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:45:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 07:45:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2024-11-09 07:45:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 123 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2024-11-09 07:45:15,800 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 37 [2024-11-09 07:45:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2024-11-09 07:45:15,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2024-11-09 07:45:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:45:15,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:15,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:45:15,801 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:15,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash -501164874, now seen corresponding path program 1 times [2024-11-09 07:45:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284241882] [2024-11-09 07:45:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284241882] [2024-11-09 07:45:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284241882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:45:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982058497] [2024-11-09 07:45:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:15,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:45:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:45:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:45:15,904 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:16,052 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2024-11-09 07:45:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:45:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:45:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:16,053 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:45:16,053 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:45:16,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:45:16,053 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:16,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 173 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:45:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2024-11-09 07:45:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 133 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2024-11-09 07:45:16,056 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 37 [2024-11-09 07:45:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2024-11-09 07:45:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2024-11-09 07:45:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:45:16,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:16,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:45:16,056 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -501164873, now seen corresponding path program 1 times [2024-11-09 07:45:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539175331] [2024-11-09 07:45:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539175331] [2024-11-09 07:45:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539175331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:45:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193574302] [2024-11-09 07:45:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:45:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:45:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:45:16,228 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:16,382 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2024-11-09 07:45:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:45:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:45:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:16,383 INFO L225 Difference]: With dead ends: 157 [2024-11-09 07:45:16,383 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 07:45:16,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:45:16,384 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:16,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 243 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 07:45:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-11-09 07:45:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-11-09 07:45:16,386 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 37 [2024-11-09 07:45:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:16,386 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-11-09 07:45:16,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-11-09 07:45:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:45:16,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:16,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:16,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:45:16,389 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:16,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash -583103786, now seen corresponding path program 1 times [2024-11-09 07:45:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:16,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403287730] [2024-11-09 07:45:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:16,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:16,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403287730] [2024-11-09 07:45:16,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403287730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:45:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733064750] [2024-11-09 07:45:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:45:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:45:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:45:16,501 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:16,663 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-11-09 07:45:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:45:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 07:45:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:16,664 INFO L225 Difference]: With dead ends: 163 [2024-11-09 07:45:16,664 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 07:45:16,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:45:16,664 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:16,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 374 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 07:45:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2024-11-09 07:45:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 135 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2024-11-09 07:45:16,666 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 39 [2024-11-09 07:45:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2024-11-09 07:45:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-09 07:45:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:45:16,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:16,668 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 07:45:16,668 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1743858476, now seen corresponding path program 1 times [2024-11-09 07:45:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279284558] [2024-11-09 07:45:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279284558] [2024-11-09 07:45:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279284558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:45:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028412151] [2024-11-09 07:45:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:17,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:45:17,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:45:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:45:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:17,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:45:17,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:45:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:45:17,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:45:17,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:45:17,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:45:17,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:45:17,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:45:17,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:45:17,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:45:17,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:45:17,402 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 16 [2024-11-09 07:45:17,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:45:17,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:45:17,429 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 16 [2024-11-09 07:45:17,439 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 16 [2024-11-09 07:45:17,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:45:17,457 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 16 [2024-11-09 07:45:17,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:45:17,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:45:17,483 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 16 [2024-11-09 07:45:17,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:17,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:17,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 07:45:17,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:17,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:45:17,592 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:45:17,592 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 65 treesize of output 58 [2024-11-09 07:45:17,596 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 28 treesize of output 11 [2024-11-09 07:45:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:45:17,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:45:17,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 07:45:17,714 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-11-09 07:45:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:17,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:45:26,241 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 72 treesize of output 70 [2024-11-09 07:45:26,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:45:26,254 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-11-09 07:45:26,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:45:26,260 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 07:45:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2024-11-09 07:45:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028412151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:45:26,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:45:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2024-11-09 07:45:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814435815] [2024-11-09 07:45:26,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:45:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:45:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:45:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=971, Unknown=38, NotChecked=0, Total=1122 [2024-11-09 07:45:26,291 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 34 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:30,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:34,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:38,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:42,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:46,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:50,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:54,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:59,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:59,330 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2024-11-09 07:45:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:45:59,330 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 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 40 [2024-11-09 07:45:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:59,331 INFO L225 Difference]: With dead ends: 177 [2024-11-09 07:45:59,331 INFO L226 Difference]: Without dead ends: 177 [2024-11-09 07:45:59,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=273, Invalid=1667, Unknown=40, NotChecked=0, Total=1980 [2024-11-09 07:45:59,332 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 31 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:59,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 871 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1147 Invalid, 8 Unknown, 0 Unchecked, 32.7s Time] [2024-11-09 07:45:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-09 07:45:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 158. [2024-11-09 07:45:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 157 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2024-11-09 07:45:59,340 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 40 [2024-11-09 07:45:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:59,340 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2024-11-09 07:45:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2024-11-09 07:45:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:45:59,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:59,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:59,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:45:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:45:59,542 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -896348025, now seen corresponding path program 1 times [2024-11-09 07:45:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135186751] [2024-11-09 07:45:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:45:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:45:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:45:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135186751] [2024-11-09 07:45:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135186751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:45:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:45:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:45:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878932663] [2024-11-09 07:45:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:45:59,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:45:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:45:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:45:59,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:45:59,681 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:45:59,870 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2024-11-09 07:45:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:45:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-09 07:45:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:45:59,871 INFO L225 Difference]: With dead ends: 184 [2024-11-09 07:45:59,871 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:45:59,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:45:59,871 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:45:59,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 286 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:45:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:45:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 159. [2024-11-09 07:45:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2312925170068028) internal successors, (181), 158 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2024-11-09 07:45:59,874 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 40 [2024-11-09 07:45:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:45:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2024-11-09 07:45:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:45:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2024-11-09 07:45:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:45:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:45:59,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:45:59,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:45:59,875 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:45:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:45:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2060914871, now seen corresponding path program 1 times [2024-11-09 07:45:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:45:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833449376] [2024-11-09 07:45:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:45:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:45:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833449376] [2024-11-09 07:46:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833449376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833000127] [2024-11-09 07:46:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:00,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:00,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:00,011 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:00,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:46:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:00,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:46:00,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:00,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:00,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:00,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 11 treesize of output 11 [2024-11-09 07:46:00,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:46:00,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:00,264 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 16 treesize of output 16 [2024-11-09 07:46:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:00,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:00,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 07:46:00,385 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 20 treesize of output 18 [2024-11-09 07:46:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833000127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:00,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:00,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-11-09 07:46:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458597051] [2024-11-09 07:46:00,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:00,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:46:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:46:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:46:00,458 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:00,831 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2024-11-09 07:46:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:46:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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 41 [2024-11-09 07:46:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:00,835 INFO L225 Difference]: With dead ends: 201 [2024-11-09 07:46:00,835 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 07:46:00,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:46:00,836 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 101 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:00,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 490 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:46:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 07:46:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2024-11-09 07:46:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 158 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2024-11-09 07:46:00,839 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 41 [2024-11-09 07:46:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2024-11-09 07:46:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2024-11-09 07:46:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:46:00,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:00,840 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:00,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:46:01,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 07:46:01,042 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:01,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:01,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2016984840, now seen corresponding path program 1 times [2024-11-09 07:46:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:01,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550051631] [2024-11-09 07:46:01,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:01,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:46:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550051631] [2024-11-09 07:46:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550051631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:46:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631311905] [2024-11-09 07:46:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:01,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:46:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:46:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:01,084 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:01,128 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2024-11-09 07:46:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:46:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 41 [2024-11-09 07:46:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:01,129 INFO L225 Difference]: With dead ends: 158 [2024-11-09 07:46:01,129 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 07:46:01,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:01,130 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:01,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:46:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 07:46:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 07:46:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 157 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2024-11-09 07:46:01,132 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 41 [2024-11-09 07:46:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:01,132 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2024-11-09 07:46:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2024-11-09 07:46:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:46:01,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:01,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:01,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 07:46:01,133 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1292175973, now seen corresponding path program 1 times [2024-11-09 07:46:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586586253] [2024-11-09 07:46:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586586253] [2024-11-09 07:46:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586586253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043209152] [2024-11-09 07:46:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:01,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:01,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:01,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:01,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:46:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:01,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:46:01,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:01,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:01,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:01,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:01,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:01,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:46:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:02,076 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:46:02,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:02,087 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:46:02,087 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 1 case distinctions, treesize of input 30 treesize of output 28 [2024-11-09 07:46:02,201 INFO L349 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2024-11-09 07:46:02,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 61 [2024-11-09 07:46:02,224 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2024-11-09 07:46:02,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2024-11-09 07:46:02,240 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 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:46:02,252 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 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-09 07:46:02,301 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 30 [2024-11-09 07:46:02,305 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 35 treesize of output 23 [2024-11-09 07:46:02,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-09 07:46:02,351 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 35 treesize of output 23 [2024-11-09 07:46:02,392 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:46:02,392 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 40 treesize of output 43 [2024-11-09 07:46:02,407 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 07:46:02,407 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 1 case distinctions, treesize of input 52 treesize of output 51 [2024-11-09 07:46:02,707 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-09 07:46:02,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 65 [2024-11-09 07:46:02,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:02,714 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 23 treesize of output 23 [2024-11-09 07:46:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:02,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:03,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (or (and (forall ((v_ArrVal_2227 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) .cse2 (select v_ArrVal_2225 .cse2)) .cse3 (select v_ArrVal_2225 .cse3)) v_ArrVal_2225)))) (forall ((v_ArrVal_2219 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_DerPreprocessor_5 Int)) (= (select (store (store (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse0)) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_DerPreprocessor_5) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2219 (Array Int Int)) (v_DerPreprocessor_5 Int)) (= (select (store (store (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse0)) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_DerPreprocessor_5) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) .cse2 (select v_ArrVal_2225 .cse2)) .cse3 (select v_ArrVal_2225 .cse3)) v_ArrVal_2225)))))))) is different from false [2024-11-09 07:46:04,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (or (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (and (forall ((v_ArrVal_2213 (Array Int Int))) (or (forall ((v_ArrVal_2227 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= v_ArrVal_2225 (store (store (select (store (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2213))) (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2213 |c_ULTIMATE.start_main_~x~0#1.offset|)))) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2225 4)) 8 (select v_ArrVal_2225 8)))))) (not (= v_ArrVal_2213 (store .cse2 .cse3 (select v_ArrVal_2213 .cse3)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2214 Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse3 v_ArrVal_2214)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0))) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_2219 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2214 Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse3 v_ArrVal_2214)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0))) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_ArrVal_2213 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= v_ArrVal_2225 (store (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2213))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2213 |c_ULTIMATE.start_main_~x~0#1.offset|)))) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2225 4)) 8 (select v_ArrVal_2225 8)))))))) (not (= v_ArrVal_2213 (store .cse2 .cse3 (select v_ArrVal_2213 .cse3))))))))) is different from false [2024-11-09 07:46:04,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (store .cse9 .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse0 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (or (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (and (forall ((v_ArrVal_2227 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (store (store .cse1 .cse2 (select v_ArrVal_2213 .cse2)) .cse3 (select v_ArrVal_2213 .cse3)) v_ArrVal_2213)) (not (= v_ArrVal_2225 (store (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2213))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2213 |c_ULTIMATE.start_main_~x~0#1.offset|)))) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2225 4)) 8 (select v_ArrVal_2225 8)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2214 Int)) (= (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_2214)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0))) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_2227 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2227) |ULTIMATE.start_main_~y~0#1.base|) 0)) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store .cse1 .cse2 (select v_ArrVal_2213 .cse2)) .cse3 (select v_ArrVal_2213 .cse3)) v_ArrVal_2213)) (not (= v_ArrVal_2225 (store (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2213))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2213 |c_ULTIMATE.start_main_~x~0#1.offset|)))) .cse0 v_ArrVal_2220) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2225 4)) 8 (select v_ArrVal_2225 8)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2214 Int)) (or (= (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_2214)))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0))) .cse0 v_ArrVal_2219) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2024-11-09 07:46:04,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:04,085 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-09 07:46:04,095 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 0 case distinctions, treesize of input 17 treesize of output 1 [2024-11-09 07:46:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043209152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:04,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:04,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 50 [2024-11-09 07:46:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587252073] [2024-11-09 07:46:04,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:04,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:46:04,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:04,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:46:04,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1819, Unknown=119, NotChecked=276, Total=2450 [2024-11-09 07:46:04,103 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:04,967 INFO L93 Difference]: Finished difference Result 221 states and 245 transitions. [2024-11-09 07:46:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:46:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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 43 [2024-11-09 07:46:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:04,968 INFO L225 Difference]: With dead ends: 221 [2024-11-09 07:46:04,968 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 07:46:04,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=305, Invalid=2436, Unknown=133, NotChecked=318, Total=3192 [2024-11-09 07:46:04,969 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 841 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1036 Invalid, 0 Unknown, 244 Unchecked, 0.6s Time] [2024-11-09 07:46:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 07:46:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 187. [2024-11-09 07:46:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 176 states have (on average 1.1875) internal successors, (209), 186 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2024-11-09 07:46:04,972 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 43 [2024-11-09 07:46:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:04,972 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2024-11-09 07:46:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2024-11-09 07:46:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:46:04,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:04,972 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:04,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 07:46:05,173 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1700600511, now seen corresponding path program 1 times [2024-11-09 07:46:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478406637] [2024-11-09 07:46:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478406637] [2024-11-09 07:46:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478406637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342356314] [2024-11-09 07:46:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:05,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:05,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:46:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:05,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:46:05,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:05,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:05,713 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:46:05,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:46:05,815 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 11 treesize of output 7 [2024-11-09 07:46:05,838 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:05,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:46:05,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:46:05,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-09 07:46:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:05,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:06,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:06,020 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 24 treesize of output 25 [2024-11-09 07:46:06,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:06,027 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 40 treesize of output 39 [2024-11-09 07:46:06,037 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 9 treesize of output 5 [2024-11-09 07:46:06,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:06,042 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 23 treesize of output 24 [2024-11-09 07:46:06,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:06,048 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 39 treesize of output 38 [2024-11-09 07:46:06,050 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 18 [2024-11-09 07:46:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342356314] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:06,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2024-11-09 07:46:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549117613] [2024-11-09 07:46:06,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:46:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:46:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=546, Unknown=6, NotChecked=0, Total=650 [2024-11-09 07:46:06,191 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:06,768 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2024-11-09 07:46:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:46:06,769 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 07:46:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:06,770 INFO L225 Difference]: With dead ends: 270 [2024-11-09 07:46:06,770 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 07:46:06,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=808, Unknown=6, NotChecked=0, Total=992 [2024-11-09 07:46:06,770 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 122 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:06,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 722 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1111 Invalid, 5 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:46:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 07:46:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 236. [2024-11-09 07:46:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 225 states have (on average 1.1822222222222223) internal successors, (266), 235 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2024-11-09 07:46:06,773 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 266 transitions. Word has length 44 [2024-11-09 07:46:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:06,774 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 266 transitions. [2024-11-09 07:46:06,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2024-11-09 07:46:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:46:06,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:06,774 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:06,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:46:06,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 07:46:06,979 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:06,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1700600512, now seen corresponding path program 1 times [2024-11-09 07:46:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917786986] [2024-11-09 07:46:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917786986] [2024-11-09 07:46:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917786986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880885235] [2024-11-09 07:46:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:07,455 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:07,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:46:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:07,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 07:46:07,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:07,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:07,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:07,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:07,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:46:07,764 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 11 treesize of output 7 [2024-11-09 07:46:07,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:07,791 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:07,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:07,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:07,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:46:07,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:46:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:07,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:07,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2547 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2547) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2547 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2547) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2548) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2024-11-09 07:46:07,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:07,948 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 24 treesize of output 25 [2024-11-09 07:46:07,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:07,952 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 40 treesize of output 39 [2024-11-09 07:46:07,958 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 9 treesize of output 5 [2024-11-09 07:46:07,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:07,967 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 45 treesize of output 46 [2024-11-09 07:46:07,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:07,970 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 35 treesize of output 36 [2024-11-09 07:46:07,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:07,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:07,973 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 33 treesize of output 21 [2024-11-09 07:46:07,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:07,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:07,979 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 24 treesize of output 12 [2024-11-09 07:46:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880885235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:08,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-11-09 07:46:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524184145] [2024-11-09 07:46:08,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:46:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:46:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=435, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:46:08,127 INFO L87 Difference]: Start difference. First operand 236 states and 266 transitions. Second operand has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:08,553 INFO L93 Difference]: Finished difference Result 291 states and 326 transitions. [2024-11-09 07:46:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:46:08,553 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 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 44 [2024-11-09 07:46:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:08,554 INFO L225 Difference]: With dead ends: 291 [2024-11-09 07:46:08,554 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 07:46:08,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=754, Unknown=1, NotChecked=58, Total=992 [2024-11-09 07:46:08,555 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 207 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:08,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 585 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 681 Invalid, 0 Unknown, 126 Unchecked, 0.3s Time] [2024-11-09 07:46:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 07:46:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 261. [2024-11-09 07:46:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.196) internal successors, (299), 260 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 299 transitions. [2024-11-09 07:46:08,559 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 299 transitions. Word has length 44 [2024-11-09 07:46:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:08,560 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 299 transitions. [2024-11-09 07:46:08,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 299 transitions. [2024-11-09 07:46:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:46:08,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:08,561 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:08,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 07:46:08,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 07:46:08,761 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:08,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1179007689, now seen corresponding path program 1 times [2024-11-09 07:46:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137521569] [2024-11-09 07:46:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:08,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137521569] [2024-11-09 07:46:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137521569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030099683] [2024-11-09 07:46:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:08,972 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:08,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:46:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:46:09,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:09,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:09,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:09,195 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 11 treesize of output 11 [2024-11-09 07:46:09,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:09,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:09,282 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-11-09 07:46:09,312 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-11-09 07:46:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:09,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:09,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2705 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2705) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) is different from false [2024-11-09 07:46:09,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:09,354 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 23 treesize of output 24 [2024-11-09 07:46:09,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:09,367 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 39 treesize of output 38 [2024-11-09 07:46:09,373 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 18 [2024-11-09 07:46:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:09,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030099683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:09,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:09,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-11-09 07:46:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085489243] [2024-11-09 07:46:09,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:46:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:46:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:46:09,536 INFO L87 Difference]: Start difference. First operand 261 states and 299 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:09,879 INFO L93 Difference]: Finished difference Result 268 states and 299 transitions. [2024-11-09 07:46:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:46:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 45 [2024-11-09 07:46:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:09,881 INFO L225 Difference]: With dead ends: 268 [2024-11-09 07:46:09,881 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 07:46:09,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=429, Unknown=1, NotChecked=44, Total=600 [2024-11-09 07:46:09,881 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 235 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:09,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 632 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 550 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2024-11-09 07:46:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 07:46:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 261. [2024-11-09 07:46:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.188) internal successors, (297), 260 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 297 transitions. [2024-11-09 07:46:09,884 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 297 transitions. Word has length 45 [2024-11-09 07:46:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:09,884 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 297 transitions. [2024-11-09 07:46:09,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 297 transitions. [2024-11-09 07:46:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:46:09,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:09,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:09,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:46:10,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:10,090 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:10,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -535604245, now seen corresponding path program 1 times [2024-11-09 07:46:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024862210] [2024-11-09 07:46:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024862210] [2024-11-09 07:46:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024862210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823480954] [2024-11-09 07:46:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:10,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:10,202 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:10,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:46:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:10,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:46:10,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:10,457 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:46:10,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-09 07:46:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:46:10,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:46:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823480954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:10,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-09 07:46:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777733810] [2024-11-09 07:46:10,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:46:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:46:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:46:10,562 INFO L87 Difference]: Start difference. First operand 261 states and 297 transitions. Second operand has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:10,886 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2024-11-09 07:46:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:46:10,886 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 0 states have call successors, (0), 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 45 [2024-11-09 07:46:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:10,887 INFO L225 Difference]: With dead ends: 275 [2024-11-09 07:46:10,887 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 07:46:10,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:46:10,887 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:10,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 225 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 07:46:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 253. [2024-11-09 07:46:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 243 states have (on average 1.168724279835391) internal successors, (284), 252 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2024-11-09 07:46:10,891 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 45 [2024-11-09 07:46:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:10,891 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2024-11-09 07:46:10,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2024-11-09 07:46:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:46:10,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:10,892 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:10,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 07:46:11,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 07:46:11,093 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2105446271, now seen corresponding path program 1 times [2024-11-09 07:46:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108111971] [2024-11-09 07:46:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:11,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108111971] [2024-11-09 07:46:11,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108111971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65039723] [2024-11-09 07:46:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:11,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:11,499 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:11,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:46:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:11,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:46:11,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:11,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:11,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:11,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:11,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:46:11,801 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 11 treesize of output 7 [2024-11-09 07:46:11,805 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 11 treesize of output 7 [2024-11-09 07:46:11,828 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:11,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:46:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:46:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:11,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:12,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2997 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2997) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (forall ((v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2996 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2997) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2996) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2024-11-09 07:46:12,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:12,010 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 22 treesize of output 23 [2024-11-09 07:46:12,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:12,015 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 40 treesize of output 39 [2024-11-09 07:46:12,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:46:12,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:12,027 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 45 treesize of output 46 [2024-11-09 07:46:12,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:12,032 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 35 treesize of output 36 [2024-11-09 07:46:12,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:12,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:12,036 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 33 treesize of output 21 [2024-11-09 07:46:12,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:12,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:12,039 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 24 treesize of output 12 [2024-11-09 07:46:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65039723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:12,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:12,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-11-09 07:46:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369280796] [2024-11-09 07:46:12,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:12,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 07:46:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 07:46:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=571, Unknown=1, NotChecked=48, Total=702 [2024-11-09 07:46:12,193 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:13,007 INFO L93 Difference]: Finished difference Result 332 states and 366 transitions. [2024-11-09 07:46:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 07:46:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 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 46 [2024-11-09 07:46:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:13,008 INFO L225 Difference]: With dead ends: 332 [2024-11-09 07:46:13,008 INFO L226 Difference]: Without dead ends: 332 [2024-11-09 07:46:13,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=1931, Unknown=1, NotChecked=92, Total=2352 [2024-11-09 07:46:13,009 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 312 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:13,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 834 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1352 Invalid, 0 Unknown, 223 Unchecked, 0.5s Time] [2024-11-09 07:46:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-09 07:46:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2024-11-09 07:46:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 287 states have (on average 1.1986062717770034) internal successors, (344), 296 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 344 transitions. [2024-11-09 07:46:13,012 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 344 transitions. Word has length 46 [2024-11-09 07:46:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 344 transitions. [2024-11-09 07:46:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 344 transitions. [2024-11-09 07:46:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:46:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:13,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:13,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 07:46:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 07:46:13,214 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 680400302, now seen corresponding path program 1 times [2024-11-09 07:46:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317830158] [2024-11-09 07:46:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317830158] [2024-11-09 07:46:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317830158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673113656] [2024-11-09 07:46:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:14,003 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 07:46:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:14,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-09 07:46:14,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:14,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:14,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:14,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:14,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:14,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:14,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:14,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:46:14,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 07:46:14,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:14,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:46:14,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-09 07:46:14,331 INFO L349 Elim1Store]: treesize reduction 64, result has 31.9 percent of original size [2024-11-09 07:46:14,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 46 [2024-11-09 07:46:14,363 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2024-11-09 07:46:14,363 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 30 treesize of output 37 [2024-11-09 07:46:14,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:14,600 INFO L349 Elim1Store]: treesize reduction 114, result has 26.9 percent of original size [2024-11-09 07:46:14,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 106 [2024-11-09 07:46:14,650 INFO L349 Elim1Store]: treesize reduction 78, result has 39.1 percent of original size [2024-11-09 07:46:14,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2024-11-09 07:46:15,018 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 07:46:15,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 138 [2024-11-09 07:46:15,035 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 07:46:15,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 126 [2024-11-09 07:46:15,043 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-11-09 07:46:15,177 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-11-09 07:46:15,180 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 13 treesize of output 9 [2024-11-09 07:46:15,187 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-11-09 07:46:15,194 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-11-09 07:46:15,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:15,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 102 [2024-11-09 07:46:15,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 168 [2024-11-09 07:46:15,396 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:46:15,396 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 51 treesize of output 48 [2024-11-09 07:46:15,404 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:46:15,404 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 47 treesize of output 42 [2024-11-09 07:46:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2024-11-09 07:46:15,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:15,436 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 1 case distinctions, treesize of input 58 treesize of output 42 [2024-11-09 07:46:15,512 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 31 treesize of output 23 [2024-11-09 07:46:15,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:15,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 34 [2024-11-09 07:46:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:15,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:16,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (forall ((v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3149 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse1 .cse2) 0) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (forall ((v_ArrVal_3150 Int) (v_ArrVal_3156 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5 v_ArrVal_3150)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3149 Int)) (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 .cse5 v_ArrVal_3149)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))))))) is different from false [2024-11-09 07:46:16,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3148 Int)) (or (< |c_ULTIMATE.start_main_#t~mem7#1.offset| v_ArrVal_3148) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (forall ((v_ArrVal_3150 Int) (v_ArrVal_3156 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse0 v_ArrVal_3150)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (forall ((v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3149 Int)) (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse0 v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int)) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)) |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse2 .cse1) 0) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (< |c_ULTIMATE.start_main_#t~mem7#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|)))))) is different from false [2024-11-09 07:46:16,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse3)) .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse1 .cse2) 0)))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3148 Int) (v_ArrVal_3149 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (< .cse0 v_ArrVal_3148) (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse3)) .cse3) .cse4 v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148)) .cse3) .cse4 v_ArrVal_3150)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|)))))) is different from false [2024-11-09 07:46:16,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse6 v_ArrVal_3143)))) (store .cse3 .cse4 (store (select (store .cse3 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4)) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (< (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_3145 (Array Int Int))) (or (not (= (store .cse2 .cse6 (select v_ArrVal_3145 .cse6)) v_ArrVal_3145)) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3148 Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (= (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3145))) (store .cse7 .cse4 (store (select (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148)) .cse4) .cse8 v_ArrVal_3150))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (< (select v_ArrVal_3145 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3148) (= (select (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse6 v_ArrVal_3143)))) (store .cse9 .cse4 (store (select (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4)) .cse4) .cse8 v_ArrVal_3149))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|))))))))) is different from false [2024-11-09 07:46:16,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse1 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (store .cse11 .cse5 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3148 Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3145))) (store .cse0 .cse1 (store (select (store .cse0 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148)) .cse1) .cse2 v_ArrVal_3150))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 0) (not (= v_ArrVal_3145 (store (store .cse4 .cse5 (select v_ArrVal_3145 .cse5)) .cse6 (select v_ArrVal_3145 .cse6)))) (< (select v_ArrVal_3145 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3148) (= (select (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse6 v_ArrVal_3143)))) (store .cse7 .cse1 (store (select (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1) .cse2 v_ArrVal_3149))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|)))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse6 v_ArrVal_3143)))) (store .cse10 .cse1 (store (select (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 .cse3) 0))))))) is different from false [2024-11-09 07:46:16,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse6 (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3148 Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (< (select v_ArrVal_3145 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3148) (not (= (store (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|) .cse0 (select v_ArrVal_3145 .cse0)) .cse1 (select v_ArrVal_3145 .cse1)) v_ArrVal_3145)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3145))) (store .cse2 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3150)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse4) 0) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse1 v_ArrVal_3143)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int) (v_ArrVal_3143 Int)) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse1 v_ArrVal_3143)))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select .cse7 .cse4) 0) (= (select (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))))) is different from false [2024-11-09 07:46:16,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3148 Int) (v_ArrVal_3149 Int) (v_ArrVal_3133 Int) (v_ArrVal_3143 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4))) (or (not (= (store (store (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_3145 .cse0)) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1 (select v_ArrVal_3145 .cse1)) .cse2 (select v_ArrVal_3145 .cse2)) v_ArrVal_3145)) (< (select v_ArrVal_3145 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3148) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3145))) (store .cse3 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3148))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3150)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3156) |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (< v_ArrVal_3148 |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse7 .cse0 v_ArrVal_3133) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3143)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (v_ArrVal_3155 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3149 Int) (v_ArrVal_3133 Int) (v_ArrVal_3143 Int)) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse7 .cse0 v_ArrVal_3133) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3143)))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_22| 4) v_ArrVal_3149)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= (select .cse8 .cse5) 0) (= (select (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2024-11-09 07:46:16,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:16,840 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 144 [2024-11-09 07:46:16,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:16,851 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:16,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-09 07:46:16,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:46:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:46:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673113656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:16,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:16,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 24] total 53 [2024-11-09 07:46:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407868477] [2024-11-09 07:46:16,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:16,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 07:46:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 07:46:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1845, Unknown=38, NotChecked=658, Total=2756 [2024-11-09 07:46:16,858 INFO L87 Difference]: Start difference. First operand 297 states and 344 transitions. Second operand has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:20,346 INFO L93 Difference]: Finished difference Result 363 states and 414 transitions. [2024-11-09 07:46:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 07:46:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 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 47 [2024-11-09 07:46:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:20,347 INFO L225 Difference]: With dead ends: 363 [2024-11-09 07:46:20,347 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 07:46:20,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=892, Invalid=6405, Unknown=41, NotChecked=1218, Total=8556 [2024-11-09 07:46:20,349 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 271 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:20,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 928 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1114 Invalid, 0 Unknown, 1046 Unchecked, 0.5s Time] [2024-11-09 07:46:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 07:46:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 301. [2024-11-09 07:46:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 291 states have (on average 1.1958762886597938) internal successors, (348), 300 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 348 transitions. [2024-11-09 07:46:20,354 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 348 transitions. Word has length 47 [2024-11-09 07:46:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:20,354 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 348 transitions. [2024-11-09 07:46:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 348 transitions. [2024-11-09 07:46:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:46:20,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:20,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:20,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 07:46:20,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-09 07:46:20,557 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:20,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash -382427718, now seen corresponding path program 1 times [2024-11-09 07:46:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756849877] [2024-11-09 07:46:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756849877] [2024-11-09 07:46:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756849877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440636199] [2024-11-09 07:46:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:20,869 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:20,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 07:46:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:21,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 07:46:21,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:21,095 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:46:21,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2024-11-09 07:46:21,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:46:21,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:21,221 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 21 treesize of output 21 [2024-11-09 07:46:21,464 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-09 07:46:21,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 87 [2024-11-09 07:46:21,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:21,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:21,493 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-09 07:46:21,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 41 [2024-11-09 07:46:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2024-11-09 07:46:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:21,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:22,047 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 31 treesize of output 27 [2024-11-09 07:46:22,049 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 55 treesize of output 51 [2024-11-09 07:46:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440636199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:26,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2024-11-09 07:46:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927912010] [2024-11-09 07:46:26,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:46:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:46:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1223, Unknown=1, NotChecked=0, Total=1332 [2024-11-09 07:46:26,976 INFO L87 Difference]: Start difference. First operand 301 states and 348 transitions. Second operand has 37 states, 36 states have (on average 3.5) internal successors, (126), 37 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:27,856 INFO L93 Difference]: Finished difference Result 303 states and 349 transitions. [2024-11-09 07:46:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:46:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.5) internal successors, (126), 37 states have internal predecessors, (126), 0 states have call successors, (0), 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 48 [2024-11-09 07:46:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:27,858 INFO L225 Difference]: With dead ends: 303 [2024-11-09 07:46:27,858 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 07:46:27,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=215, Invalid=2136, Unknown=1, NotChecked=0, Total=2352 [2024-11-09 07:46:27,859 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:27,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 475 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:46:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 07:46:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-09 07:46:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 275 states have (on average 1.2036363636363636) internal successors, (331), 284 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 331 transitions. [2024-11-09 07:46:27,862 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 331 transitions. Word has length 48 [2024-11-09 07:46:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 331 transitions. [2024-11-09 07:46:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.5) internal successors, (126), 37 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 331 transitions. [2024-11-09 07:46:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:46:27,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:27,863 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:27,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:28,065 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 07:46:28,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash 352581361, now seen corresponding path program 1 times [2024-11-09 07:46:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504875958] [2024-11-09 07:46:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504875958] [2024-11-09 07:46:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504875958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590625705] [2024-11-09 07:46:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:28,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:28,684 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:28,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 07:46:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:28,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 07:46:28,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:28,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:46:28,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:28,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:28,925 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 11 treesize of output 7 [2024-11-09 07:46:28,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:28,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:46:28,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:46:29,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:46:29,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 07:46:29,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 64 [2024-11-09 07:46:29,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-09 07:46:29,432 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:46:29,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 37 [2024-11-09 07:46:29,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 07:46:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:29,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:36,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse8 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3462 (Array Int Int)) (v_ArrVal_3467 Int) (v_ArrVal_3460 Int)) (or (not (= v_ArrVal_3462 (store (store .cse0 .cse1 (select v_ArrVal_3462 .cse1)) .cse2 (select v_ArrVal_3462 .cse2)))) (let ((.cse3 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3462))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| .cse11) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse12 |c_ULTIMATE.start_main_~last~0#1.base| .cse11) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.offset|)))))) (let ((.cse10 (select (select .cse3 |c_ULTIMATE.start_main_~first~0#1.base|) .cse9))) (= (select (select .cse3 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse2 v_ArrVal_3460)))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse4) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse5 |c_ULTIMATE.start_main_~last~0#1.base| .cse4) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3467)))) |c_ULTIMATE.start_main_~first~0#1.base|) .cse9)) .cse10) .cse10))))) (forall ((v_ArrVal_3462 (Array Int Int)) (v_ArrVal_3467 Int) (v_ArrVal_3460 Int)) (or (let ((.cse14 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse2 v_ArrVal_3460)))) (let ((.cse17 (store (select .cse18 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse17) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse18 |c_ULTIMATE.start_main_~last~0#1.base| .cse17) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3467)))))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~first~0#1.base|) .cse9))) (= .cse13 (select (select .cse14 .cse13) (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3462))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| .cse15) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_main_~last~0#1.base| .cse15) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.offset|)))) |c_ULTIMATE.start_main_~first~0#1.base|) .cse9))))) (not (= v_ArrVal_3462 (store (store .cse0 .cse1 (select v_ArrVal_3462 .cse1)) .cse2 (select v_ArrVal_3462 .cse2))))))))) is different from false