./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/tree-2.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/heap-manipulation/tree-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:57:19,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:57:19,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:57:19,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:57:19,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:57:19,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:57:19,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:57:19,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:57:19,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:57:19,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:57:19,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:57:19,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:57:19,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:57:19,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:57:19,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:57:19,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:57:19,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:57:19,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:57:19,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:57:19,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:57:19,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:57:19,608 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:57:19,608 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:57:19,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:57:19,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:57:19,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:57:19,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:57:19,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:57:19,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:57:19,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:57:19,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:57:19,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:57:19,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:57:19,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:19,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:57:19,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:57:19,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:57:19,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:57:19,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:57:19,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:57:19,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:57:19,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:57:19,613 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2024-11-09 07:57:19,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:57:19,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:57:19,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:57:19,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:57:19,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:57:19,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-2.i [2024-11-09 07:57:21,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:57:21,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:57:21,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-2.i [2024-11-09 07:57:21,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2b6ac10/4f767ba7357d41258085008e3f71ebab/FLAG092162ee9 [2024-11-09 07:57:21,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2b6ac10/4f767ba7357d41258085008e3f71ebab [2024-11-09 07:57:21,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:57:21,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:57:21,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:21,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:57:21,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:57:21,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21, skipping insertion in model container [2024-11-09 07:57:21,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:57:21,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:21,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:57:21,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:21,675 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:57:21,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21 WrapperNode [2024-11-09 07:57:21,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:21,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:21,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:57:21,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:57:21,683 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:57:21" (1/1) ... [2024-11-09 07:57:21,697 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:57:21" (1/1) ... [2024-11-09 07:57:21,727 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2024-11-09 07:57:21,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:21,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:57:21,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:57:21,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:57:21,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,771 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-09 07:57:21,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:57:21,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:57:21,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:57:21,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:57:21,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (1/1) ... [2024-11-09 07:57:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:21,840 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:57:21,842 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:57:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:57:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:57:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-09 07:57:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:57:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:57:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:57:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:57:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:57:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:57:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:57:21,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:57:21,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:57:21,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:57:22,289 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-09 07:57:22,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:57:22,304 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:57:22,307 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-09 07:57:22,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:22 BoogieIcfgContainer [2024-11-09 07:57:22,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:57:22,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:57:22,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:57:22,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:57:22,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:57:21" (1/3) ... [2024-11-09 07:57:22,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e2964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:22, skipping insertion in model container [2024-11-09 07:57:22,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:21" (2/3) ... [2024-11-09 07:57:22,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e2964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:22, skipping insertion in model container [2024-11-09 07:57:22,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:22" (3/3) ... [2024-11-09 07:57:22,315 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2024-11-09 07:57:22,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:57:22,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2024-11-09 07:57:22,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:57:22,371 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;@44a1d278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:57:22,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-11-09 07:57:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 80 states have (on average 2.1375) internal successors, (171), 146 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:57:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:57:22,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:22,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:57:22,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:22,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash 39226098, now seen corresponding path program 1 times [2024-11-09 07:57:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359209015] [2024-11-09 07:57:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:22,517 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:57:22,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:22,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359209015] [2024-11-09 07:57:22,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359209015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:22,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:22,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132924589] [2024-11-09 07:57:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:57:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:22,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:57:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:57:22,552 INFO L87 Difference]: Start difference. First operand has 148 states, 80 states have (on average 2.1375) internal successors, (171), 146 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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:57:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:22,575 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2024-11-09 07:57:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:57:22,577 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:57:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:22,606 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:57:22,607 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:57:22,609 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:57:22,612 INFO L432 NwaCegarLoop]: 156 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, 156 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:57:22,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:57:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 07:57:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 141 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2024-11-09 07:57:22,684 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 5 [2024-11-09 07:57:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:22,689 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2024-11-09 07:57:22,689 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:57:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2024-11-09 07:57:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:57:22,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:22,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:57:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:57:22,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1214988456, now seen corresponding path program 1 times [2024-11-09 07:57:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164434659] [2024-11-09 07:57:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164434659] [2024-11-09 07:57:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164434659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38467197] [2024-11-09 07:57:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:22,779 INFO L87 Difference]: Start difference. First operand 143 states and 154 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:57:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:22,853 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-09 07:57:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:22,853 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:57:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:22,855 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:57:22,857 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 07:57:22,859 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:57:22,860 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:22,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 07:57:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-09 07:57:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 80 states have (on average 1.9375) internal successors, (155), 144 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-09 07:57:22,870 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 6 [2024-11-09 07:57:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:22,872 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-09 07:57:22,872 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:57:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-09 07:57:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:57:22,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:22,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:57:22,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:57:22,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1214989356, now seen corresponding path program 1 times [2024-11-09 07:57:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203660393] [2024-11-09 07:57:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:22,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203660393] [2024-11-09 07:57:22,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203660393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:22,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:22,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991049760] [2024-11-09 07:57:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:22,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:22,974 INFO L87 Difference]: Start difference. First operand 146 states and 158 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:57:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,126 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2024-11-09 07:57:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:23,127 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:57:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,128 INFO L225 Difference]: With dead ends: 168 [2024-11-09 07:57:23,130 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 07:57:23,130 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:57:23,131 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:23,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 07:57:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2024-11-09 07:57:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 158 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2024-11-09 07:57:23,141 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 6 [2024-11-09 07:57:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,141 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2024-11-09 07:57:23,141 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:57:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2024-11-09 07:57:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:57:23,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:57:23,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1214989355, now seen corresponding path program 1 times [2024-11-09 07:57:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88020171] [2024-11-09 07:57:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,184 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:57:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88020171] [2024-11-09 07:57:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88020171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71778991] [2024-11-09 07:57:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:23,186 INFO L87 Difference]: Start difference. First operand 160 states and 187 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:57:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,289 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2024-11-09 07:57:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:23,289 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:57:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,291 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:57:23,291 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:57:23,292 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:57:23,293 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 35 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:23,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:57:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 07:57:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.7525773195876289) internal successors, (170), 150 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2024-11-09 07:57:23,299 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 6 [2024-11-09 07:57:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2024-11-09 07:57:23,300 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:57:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2024-11-09 07:57:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:57:23,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:57:23,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2031260578, now seen corresponding path program 1 times [2024-11-09 07:57:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738191462] [2024-11-09 07:57:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,325 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:57:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738191462] [2024-11-09 07:57:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738191462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821092023] [2024-11-09 07:57:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:23,328 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,418 INFO L93 Difference]: Finished difference Result 231 states and 261 transitions. [2024-11-09 07:57:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:57:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,419 INFO L225 Difference]: With dead ends: 231 [2024-11-09 07:57:23,420 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 07:57:23,420 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:57:23,421 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 79 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:23,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 197 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 07:57:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 155. [2024-11-09 07:57:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.73) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2024-11-09 07:57:23,436 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 9 [2024-11-09 07:57:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,436 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2024-11-09 07:57:23,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2024-11-09 07:57:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:57:23,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:57:23,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2058474553, now seen corresponding path program 1 times [2024-11-09 07:57:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269199565] [2024-11-09 07:57:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,502 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:57:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269199565] [2024-11-09 07:57:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269199565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650648675] [2024-11-09 07:57:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:23,507 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,524 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2024-11-09 07:57:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:57:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,526 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:57:23,526 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 07:57:23,526 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:57:23,526 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:23,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 07:57:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 07:57:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.7019230769230769) internal successors, (177), 157 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2024-11-09 07:57:23,534 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 9 [2024-11-09 07:57:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,534 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2024-11-09 07:57:23,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2024-11-09 07:57:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:57:23,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:57:23,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1151297537, now seen corresponding path program 1 times [2024-11-09 07:57:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088082972] [2024-11-09 07:57:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,611 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:57:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088082972] [2024-11-09 07:57:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088082972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750768255] [2024-11-09 07:57:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:23,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:23,613 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,644 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2024-11-09 07:57:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:57:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,645 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:57:23,645 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 07:57:23,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:23,646 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 4 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:23,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 545 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 07:57:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 07:57:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.72) internal successors, (172), 153 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2024-11-09 07:57:23,654 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 13 [2024-11-09 07:57:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2024-11-09 07:57:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2024-11-09 07:57:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:23,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,655 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:57:23,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1177300553, now seen corresponding path program 1 times [2024-11-09 07:57:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809689667] [2024-11-09 07:57:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,703 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:57:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809689667] [2024-11-09 07:57:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809689667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196273403] [2024-11-09 07:57:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:23,705 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:23,744 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2024-11-09 07:57:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:57:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:23,746 INFO L225 Difference]: With dead ends: 163 [2024-11-09 07:57:23,746 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 07:57:23,746 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:57:23,747 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 240 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:57:23,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 240 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 07:57:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2024-11-09 07:57:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.71) internal successors, (171), 153 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2024-11-09 07:57:23,751 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 18 [2024-11-09 07:57:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:23,751 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2024-11-09 07:57:23,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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:57:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2024-11-09 07:57:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:23,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:57:23,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1204514528, now seen corresponding path program 1 times [2024-11-09 07:57:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503997605] [2024-11-09 07:57:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503997605] [2024-11-09 07:57:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503997605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094459838] [2024-11-09 07:57:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:23,961 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:57:23,962 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:57:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:57:24,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:24,080 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:57:24,119 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:57:24,121 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 12 treesize of output 14 [2024-11-09 07:57:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094459838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:24,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-09 07:57:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971493847] [2024-11-09 07:57:24,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:24,185 INFO L87 Difference]: Start difference. First operand 155 states and 174 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:57:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:24,309 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2024-11-09 07:57:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:24,309 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 18 [2024-11-09 07:57:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:24,311 INFO L225 Difference]: With dead ends: 154 [2024-11-09 07:57:24,311 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 07:57:24,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:24,311 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 65 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:24,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 295 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 07:57:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 07:57:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.7) internal successors, (170), 152 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2024-11-09 07:57:24,316 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 18 [2024-11-09 07:57:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:24,316 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2024-11-09 07:57:24,316 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:57:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2024-11-09 07:57:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:24,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:24,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:24,331 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:57:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:24,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1204514529, now seen corresponding path program 1 times [2024-11-09 07:57:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37729934] [2024-11-09 07:57:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37729934] [2024-11-09 07:57:24,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37729934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745667528] [2024-11-09 07:57:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:24,707 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:57:24,708 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:57:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:57:24,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:24,792 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:57:24,797 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:57:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:24,873 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:57:24,883 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:24,884 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:57:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745667528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:25,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 07:57:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822135931] [2024-11-09 07:57:25,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:25,178 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:57:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:25,424 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-09 07:57:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 18 [2024-11-09 07:57:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:25,425 INFO L225 Difference]: With dead ends: 161 [2024-11-09 07:57:25,425 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 07:57:25,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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:57:25,426 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 238 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:25,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 422 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 07:57:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2024-11-09 07:57:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.69) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2024-11-09 07:57:25,430 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 18 [2024-11-09 07:57:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:25,430 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2024-11-09 07:57:25,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:57:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2024-11-09 07:57:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:57:25,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,431 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:57:25,447 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:57:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:57:25,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2144046327, now seen corresponding path program 1 times [2024-11-09 07:57:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364941842] [2024-11-09 07:57:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,710 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:57:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364941842] [2024-11-09 07:57:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364941842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:25,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035438422] [2024-11-09 07:57:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:25,712 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:25,821 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2024-11-09 07:57:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:57:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:25,822 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:57:25,822 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:57:25,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:25,823 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:25,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 369 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:57:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 07:57:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.67) internal successors, (167), 150 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2024-11-09 07:57:25,826 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 19 [2024-11-09 07:57:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:25,826 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2024-11-09 07:57:25,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2024-11-09 07:57:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:57:25,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,828 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:57:25,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:57:25,828 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:25,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2144046326, now seen corresponding path program 1 times [2024-11-09 07:57:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120465866] [2024-11-09 07:57:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,962 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:57:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120465866] [2024-11-09 07:57:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120465866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:25,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831487035] [2024-11-09 07:57:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:25,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:25,963 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,075 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2024-11-09 07:57:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:57:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,076 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:57:26,076 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:57:26,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:26,077 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:57:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 07:57:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.65) internal successors, (165), 149 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-09 07:57:26,080 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 19 [2024-11-09 07:57:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,080 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-09 07:57:26,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-09 07:57:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:57:26,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,081 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:57:26,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:26,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1469545161, now seen corresponding path program 1 times [2024-11-09 07:57:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401607421] [2024-11-09 07:57:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,248 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:57:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401607421] [2024-11-09 07:57:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401607421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260849120] [2024-11-09 07:57:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:26,250 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,487 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-09 07:57:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:57:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,488 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:57:26,489 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:57:26,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:26,489 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 547 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:57:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-09 07:57:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.64) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2024-11-09 07:57:26,493 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 22 [2024-11-09 07:57:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,493 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2024-11-09 07:57:26,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2024-11-09 07:57:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:57:26,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,494 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:57:26,494 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1469545162, now seen corresponding path program 1 times [2024-11-09 07:57:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261006189] [2024-11-09 07:57:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,773 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:57:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261006189] [2024-11-09 07:57:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261006189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799582555] [2024-11-09 07:57:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:26,777 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,997 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-09 07:57:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:57:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,999 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:57:26,999 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:57:26,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:26,999 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 34 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 494 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:57:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 07:57:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.63) internal successors, (163), 149 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2024-11-09 07:57:27,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 22 [2024-11-09 07:57:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,002 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2024-11-09 07:57:27,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2024-11-09 07:57:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:57:27,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,003 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:57:27,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:57:27,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:27,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 618296880, now seen corresponding path program 1 times [2024-11-09 07:57:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131107953] [2024-11-09 07:57:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,223 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:57:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131107953] [2024-11-09 07:57:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131107953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348649482] [2024-11-09 07:57:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:27,225 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,455 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-11-09 07:57:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,456 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:57:27,456 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:57:27,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:27,459 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 39 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 548 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:57:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-09 07:57:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.62) internal successors, (162), 149 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2024-11-09 07:57:27,466 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 25 [2024-11-09 07:57:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2024-11-09 07:57:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2024-11-09 07:57:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:57:27,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,467 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:57:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:57:27,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 618296881, now seen corresponding path program 1 times [2024-11-09 07:57:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990545054] [2024-11-09 07:57:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,766 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:57:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990545054] [2024-11-09 07:57:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990545054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605226260] [2024-11-09 07:57:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:27,768 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:28,022 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2024-11-09 07:57:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:28,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:28,023 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:57:28,023 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:57:28,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:28,024 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:28,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 573 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:57:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 07:57:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.61) internal successors, (161), 149 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2024-11-09 07:57:28,026 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 25 [2024-11-09 07:57:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2024-11-09 07:57:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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:57:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2024-11-09 07:57:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:57:28,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:28,027 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] [2024-11-09 07:57:28,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:57:28,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:28,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1432319856, now seen corresponding path program 1 times [2024-11-09 07:57:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713194967] [2024-11-09 07:57:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,268 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:57:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713194967] [2024-11-09 07:57:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713194967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699215130] [2024-11-09 07:57:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:28,270 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:28,482 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2024-11-09 07:57:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:57:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:28,484 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:57:28,484 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:57:28,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:57:28,485 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 46 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:28,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 410 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:57:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-09 07:57:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.6) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-09 07:57:28,487 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 28 [2024-11-09 07:57:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:28,488 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-09 07:57:28,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-09 07:57:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:57:28,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:28,488 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] [2024-11-09 07:57:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:57:28,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1432319855, now seen corresponding path program 1 times [2024-11-09 07:57:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697635606] [2024-11-09 07:57:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,845 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:57:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697635606] [2024-11-09 07:57:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697635606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715127422] [2024-11-09 07:57:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:28,848 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,095 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2024-11-09 07:57:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:57:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,096 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:57:29,096 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:57:29,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:57:29,097 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 423 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:57:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 07:57:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.59) internal successors, (159), 149 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2024-11-09 07:57:29,100 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 28 [2024-11-09 07:57:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2024-11-09 07:57:29,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2024-11-09 07:57:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:57:29,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,102 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] [2024-11-09 07:57:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:57:29,102 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash 101515096, now seen corresponding path program 1 times [2024-11-09 07:57:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635754500] [2024-11-09 07:57:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635754500] [2024-11-09 07:57:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635754500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387651421] [2024-11-09 07:57:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:29,593 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:57:29,594 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:57:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:57:29,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:29,713 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:57:29,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:57:29,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:57:29,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:57:29,760 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 29 treesize of output 13 [2024-11-09 07:57:29,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:29,788 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:57:29,801 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 25 treesize of output 13 [2024-11-09 07:57:29,806 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 25 treesize of output 13 [2024-11-09 07:57:29,856 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:29,856 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:57:29,860 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 26 treesize of output 13 [2024-11-09 07:57:29,912 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:29,912 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:57:29,919 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 26 treesize of output 13 [2024-11-09 07:57:29,963 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:29,963 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:57:29,968 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 26 treesize of output 13 [2024-11-09 07:57:30,013 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:30,014 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:57:30,020 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 26 treesize of output 13 [2024-11-09 07:57:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:30,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:30,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_605 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_604 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_604) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:57:30,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_604 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_604) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2024-11-09 07:57:30,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_603) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_602) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_602))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:57:30,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_603) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_602) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)))) is different from false [2024-11-09 07:57:30,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_601) .cse1 v_ArrVal_603) (select (select (store .cse2 .cse1 v_ArrVal_602) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_600))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_602)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)))) is different from false [2024-11-09 07:57:30,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_599))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_598) .cse0 v_ArrVal_601) .cse1 v_ArrVal_603) (select (select (store .cse2 .cse1 v_ArrVal_602) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_599))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_600)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_602)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)))) is different from false [2024-11-09 07:57:30,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |c_ULTIMATE.start_create_tree_#t~malloc11#1.base|))) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (|ULTIMATE.start_create_tree_#t~malloc11#1.offset| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_599))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |ULTIMATE.start_create_tree_#t~malloc11#1.offset|)) |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_598) .cse0 v_ArrVal_601) .cse1 v_ArrVal_603) (select (select (store .cse2 .cse1 v_ArrVal_602) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_599))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_600)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_602)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2024-11-09 07:57:32,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,590 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 3 case distinctions, treesize of input 226 treesize of output 237 [2024-11-09 07:57:32,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,613 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 208 treesize of output 111 [2024-11-09 07:57:32,634 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 48829 treesize of output 35979 [2024-11-09 07:57:32,694 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 11254 treesize of output 11014 [2024-11-09 07:57:32,732 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 252 treesize of output 234 [2024-11-09 07:57:32,740 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 234 treesize of output 210 [2024-11-09 07:57:32,747 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 210 treesize of output 194 [2024-11-09 07:57:32,765 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 159 treesize of output 151 [2024-11-09 07:57:32,778 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 151 treesize of output 147 [2024-11-09 07:57:32,787 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 182 treesize of output 174 [2024-11-09 07:57:32,795 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 174 treesize of output 166 [2024-11-09 07:57:32,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,880 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 3 case distinctions, treesize of input 226 treesize of output 111 [2024-11-09 07:57:32,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,899 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 34322 treesize of output 28436 [2024-11-09 07:57:32,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,941 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 189 treesize of output 169 [2024-11-09 07:57:32,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,951 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 169 treesize of output 153 [2024-11-09 07:57:32,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 141 [2024-11-09 07:57:32,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:32,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 125 [2024-11-09 07:57:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387651421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:33,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 18] total 30 [2024-11-09 07:57:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091784392] [2024-11-09 07:57:33,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:57:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:57:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=410, Unknown=30, NotChecked=336, Total=870 [2024-11-09 07:57:33,133 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:57:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:35,300 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2024-11-09 07:57:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:57:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 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 33 [2024-11-09 07:57:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:35,301 INFO L225 Difference]: With dead ends: 175 [2024-11-09 07:57:35,302 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 07:57:35,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=167, Invalid=755, Unknown=36, NotChecked=448, Total=1406 [2024-11-09 07:57:35,302 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 24 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:35,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2439 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 789 Invalid, 0 Unknown, 495 Unchecked, 1.6s Time] [2024-11-09 07:57:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 07:57:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-09 07:57:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.4838709677419355) internal successors, (184), 173 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 187 transitions. [2024-11-09 07:57:35,306 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 187 transitions. Word has length 33 [2024-11-09 07:57:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 187 transitions. [2024-11-09 07:57:35,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:57:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2024-11-09 07:57:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:57:35,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:35,307 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:35,320 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:57:35,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:35,508 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash 578819826, now seen corresponding path program 1 times [2024-11-09 07:57:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187297530] [2024-11-09 07:57:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:35,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187297530] [2024-11-09 07:57:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187297530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:35,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:35,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:57:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059235646] [2024-11-09 07:57:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:35,614 INFO L87 Difference]: Start difference. First operand 175 states and 187 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:57:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:35,819 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2024-11-09 07:57:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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 36 [2024-11-09 07:57:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:35,820 INFO L225 Difference]: With dead ends: 175 [2024-11-09 07:57:35,820 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 07:57:35,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:35,821 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:35,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 525 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 07:57:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-09 07:57:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.467741935483871) internal successors, (182), 173 states have internal predecessors, (182), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2024-11-09 07:57:35,826 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 36 [2024-11-09 07:57:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:35,826 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2024-11-09 07:57:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:57:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2024-11-09 07:57:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:57:35,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:35,827 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:35,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:57:35,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:35,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 549188431, now seen corresponding path program 1 times [2024-11-09 07:57:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:35,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896854040] [2024-11-09 07:57:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:35,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896854040] [2024-11-09 07:57:35,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896854040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:35,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273969554] [2024-11-09 07:57:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:35,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:35,927 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:36,191 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2024-11-09 07:57:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 07:57:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:36,193 INFO L225 Difference]: With dead ends: 189 [2024-11-09 07:57:36,193 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 07:57:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:36,193 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 109 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 561 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 07:57:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2024-11-09 07:57:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 125 states have (on average 1.456) internal successors, (182), 173 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2024-11-09 07:57:36,198 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 40 [2024-11-09 07:57:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2024-11-09 07:57:36,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2024-11-09 07:57:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:36,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:36,199 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:36,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:57:36,199 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash -675080879, now seen corresponding path program 1 times [2024-11-09 07:57:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721011775] [2024-11-09 07:57:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721011775] [2024-11-09 07:57:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721011775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984638413] [2024-11-09 07:57:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:36,328 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:57:36,329 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:57:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:36,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:57:36,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:36,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:36,605 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:57:36,606 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 12 treesize of output 11 [2024-11-09 07:57:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984638413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:36,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 07:57:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107790974] [2024-11-09 07:57:36,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:36,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:36,625 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 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:57:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,198 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2024-11-09 07:57:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 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 39 [2024-11-09 07:57:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,200 INFO L225 Difference]: With dead ends: 173 [2024-11-09 07:57:37,200 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 07:57:37,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:37,200 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 475 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 07:57:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-09 07:57:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4365079365079365) internal successors, (181), 171 states have internal predecessors, (181), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2024-11-09 07:57:37,204 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 39 [2024-11-09 07:57:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2024-11-09 07:57:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 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:57:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2024-11-09 07:57:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:37,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,205 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:37,221 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:57:37,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:37,407 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -675080878, now seen corresponding path program 1 times [2024-11-09 07:57:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388703167] [2024-11-09 07:57:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388703167] [2024-11-09 07:57:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388703167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796675674] [2024-11-09 07:57:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:37,633 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:57:37,635 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:57:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:57:37,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:37,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:38,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:38,158 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 19 treesize of output 23 [2024-11-09 07:57:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796675674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:38,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 07:57:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214616194] [2024-11-09 07:57:38,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:57:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:57:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:38,437 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:57:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:39,476 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2024-11-09 07:57:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:57:39,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 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:57:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:39,477 INFO L225 Difference]: With dead ends: 185 [2024-11-09 07:57:39,477 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 07:57:39,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:57:39,477 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 135 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:39,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 871 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:57:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 07:57:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2024-11-09 07:57:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 170 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 181 transitions. [2024-11-09 07:57:39,480 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 181 transitions. Word has length 39 [2024-11-09 07:57:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:39,480 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 181 transitions. [2024-11-09 07:57:39,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:57:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 181 transitions. [2024-11-09 07:57:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:57:39,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:39,481 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:39,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:57:39,685 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,SelfDestructingSolverStorable22 [2024-11-09 07:57:39,686 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:39,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash -212658570, now seen corresponding path program 1 times [2024-11-09 07:57:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116221031] [2024-11-09 07:57:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116221031] [2024-11-09 07:57:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116221031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301038365] [2024-11-09 07:57:40,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:40,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:40,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:40,100 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:57:40,102 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:57:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:40,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:57:40,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:40,266 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:57:40,306 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-09 07:57:40,306 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 12 treesize of output 18 [2024-11-09 07:57:40,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:40,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 07:57:40,658 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-11-09 07:57:40,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 28 [2024-11-09 07:57:41,073 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-09 07:57:41,073 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 26 treesize of output 31 [2024-11-09 07:57:41,110 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-09 07:57:41,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 32 [2024-11-09 07:57:41,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 07:57:41,271 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:57:41,279 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:57:41,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:41,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:41,902 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 43 treesize of output 38 [2024-11-09 07:57:41,909 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:57:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301038365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:44,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-11-09 07:57:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86379052] [2024-11-09 07:57:44,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:57:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:57:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:57:44,174 INFO L87 Difference]: Start difference. First operand 172 states and 181 transitions. Second operand has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:57:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:46,749 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-11-09 07:57:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 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:57:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:46,750 INFO L225 Difference]: With dead ends: 185 [2024-11-09 07:57:46,750 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 07:57:46,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:57:46,751 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 432 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:46,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 784 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 07:57:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 07:57:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2024-11-09 07:57:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 179 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2024-11-09 07:57:46,754 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 41 [2024-11-09 07:57:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:46,754 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2024-11-09 07:57:46,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:57:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2024-11-09 07:57:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:57:46,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:46,755 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:46,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:46,959 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-09 07:57:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1997494212, now seen corresponding path program 1 times [2024-11-09 07:57:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112256606] [2024-11-09 07:57:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112256606] [2024-11-09 07:57:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112256606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829864456] [2024-11-09 07:57:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:47,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:47,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:47,694 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:57:47,695 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:57:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 07:57:47,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:47,912 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-09 07:57:47,913 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 12 treesize of output 18 [2024-11-09 07:57:48,134 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-09 07:57:48,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 32 [2024-11-09 07:57:48,227 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:57:48,236 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:57:48,368 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:57:48,449 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:57:48,449 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 44 treesize of output 34 [2024-11-09 07:57:48,660 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-09 07:57:48,660 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 2 case distinctions, treesize of input 61 treesize of output 52 [2024-11-09 07:57:48,916 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-09 07:57:48,916 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 47 [2024-11-09 07:57:49,137 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:49,140 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 47 [2024-11-09 07:57:49,726 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 41 treesize of output 25 [2024-11-09 07:57:49,834 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:57:49,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:51,738 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2024-11-09 07:57:51,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 682 treesize of output 346 [2024-11-09 07:57:52,040 INFO L349 Elim1Store]: treesize reduction 131, result has 38.2 percent of original size [2024-11-09 07:57:52,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 6051 treesize of output 5441 [2024-11-09 07:57:52,400 INFO L349 Elim1Store]: treesize reduction 26, result has 70.8 percent of original size [2024-11-09 07:57:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 23577 treesize of output 21095 [2024-11-09 07:57:52,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:52,724 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 4056 treesize of output 3758 [2024-11-09 07:57:52,910 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 3120 treesize of output 3012 [2024-11-09 07:57:55,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:55,456 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 311 treesize of output 313 [2024-11-09 07:57:56,964 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 6 treesize of output 4 [2024-11-09 07:57:57,959 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 6 treesize of output 4 [2024-11-09 07:57:58,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:58,429 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 128 treesize of output 122 [2024-11-09 07:57:58,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:58,655 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2024-11-09 07:57:58,718 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 6 treesize of output 4 [2024-11-09 07:57:58,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:58,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 526 treesize of output 520 [2024-11-09 07:58:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829864456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:58:39,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:58:39,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 47 [2024-11-09 07:58:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921031964] [2024-11-09 07:58:39,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:39,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 07:58:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:39,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 07:58:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2069, Unknown=5, NotChecked=0, Total=2256 [2024-11-09 07:58:39,009 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 48 states, 47 states have (on average 2.5531914893617023) internal successors, (120), 48 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:58:45,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]