./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:39:35,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:39:35,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:39:35,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:39:35,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:39:35,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:39:35,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:39:35,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:39:35,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:39:35,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:39:35,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:39:35,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:39:35,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:39:35,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:39:35,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:39:35,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:39:35,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:39:35,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:39:35,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:39:35,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:39:35,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:39:35,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:39:35,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:39:35,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:39:35,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:39:35,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:39:35,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:39:35,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:39:35,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:39:35,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:39:35,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:39:35,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:39:35,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:35,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:39:35,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:39:35,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:39:35,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:39:35,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:39:35,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:39:35,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:39:35,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:39:35,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:39:35,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2024-10-11 01:39:35,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:39:35,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:39:35,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:39:35,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:39:35,618 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:39:35,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-10-11 01:39:37,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:39:37,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:39:37,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-10-11 01:39:37,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0cae2773/4c10edc9a2754c959807d67280133141/FLAGbf7481e84 [2024-10-11 01:39:37,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0cae2773/4c10edc9a2754c959807d67280133141 [2024-10-11 01:39:37,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:39:37,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:39:37,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:37,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:39:37,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:39:37,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:37" (1/1) ... [2024-10-11 01:39:37,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280c76b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:37, skipping insertion in model container [2024-10-11 01:39:37,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:37" (1/1) ... [2024-10-11 01:39:37,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:39:38,044 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-10-11 01:39:38,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:38,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:39:38,113 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2024-10-11 01:39:38,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:38,142 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:39:38,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38 WrapperNode [2024-10-11 01:39:38,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:38,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:38,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:39:38,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:39:38,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,186 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2024-10-11 01:39:38,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:38,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:39:38,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:39:38,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:39:38,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,222 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-10-11 01:39:38,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:39:38,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:39:38,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:39:38,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:39:38,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (1/1) ... [2024-10-11 01:39:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:38,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:39:38,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:39:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:39:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:39:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:39:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:39:38,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:39:38,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:39:38,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:39:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:39:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:39:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:39:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:39:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:39:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:39:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:39:38,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:39:38,471 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:39:38,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:39:38,726 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 01:39:38,726 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:39:38,760 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:39:38,761 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:39:38,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:38 BoogieIcfgContainer [2024-10-11 01:39:38,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:39:38,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:39:38,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:39:38,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:39:38,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:39:37" (1/3) ... [2024-10-11 01:39:38,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743eb325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:38, skipping insertion in model container [2024-10-11 01:39:38,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:38" (2/3) ... [2024-10-11 01:39:38,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743eb325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:38, skipping insertion in model container [2024-10-11 01:39:38,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:38" (3/3) ... [2024-10-11 01:39:38,772 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2024-10-11 01:39:38,791 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:39:38,791 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:39:38,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:39:38,862 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=LoopHeads, 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;@75367634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:39:38,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:39:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:39:38,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:38,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:38,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash -218752740, now seen corresponding path program 1 times [2024-10-11 01:39:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272615470] [2024-10-11 01:39:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272615470] [2024-10-11 01:39:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272615470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:39:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736527003] [2024-10-11 01:39:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:39,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:39:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:39:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:39:39,139 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:39,166 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2024-10-11 01:39:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:39:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 01:39:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:39,175 INFO L225 Difference]: With dead ends: 46 [2024-10-11 01:39:39,175 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 01:39:39,177 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-10-11 01:39:39,207 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:39,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 01:39:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 01:39:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-10-11 01:39:39,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 14 [2024-10-11 01:39:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:39,272 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-10-11 01:39:39,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-10-11 01:39:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:39,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:39,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:39,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:39:39,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:39,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 43418518, now seen corresponding path program 1 times [2024-10-11 01:39:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:39,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075403418] [2024-10-11 01:39:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075403418] [2024-10-11 01:39:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075403418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033017082] [2024-10-11 01:39:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:39,430 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:39,447 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2024-10-11 01:39:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:39,449 INFO L225 Difference]: With dead ends: 24 [2024-10-11 01:39:39,450 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 01:39:39,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:39,451 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:39,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 01:39:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 01:39:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-10-11 01:39:39,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2024-10-11 01:39:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:39,460 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-11 01:39:39,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-10-11 01:39:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:39,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:39,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:39,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:39:39,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:39,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash 43420440, now seen corresponding path program 1 times [2024-10-11 01:39:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:39,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705784610] [2024-10-11 01:39:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705784610] [2024-10-11 01:39:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705784610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:39:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655689557] [2024-10-11 01:39:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:39,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:39,829 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:39,996 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-10-11 01:39:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:39,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:39,998 INFO L225 Difference]: With dead ends: 35 [2024-10-11 01:39:39,999 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 01:39:40,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:39:40,001 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:40,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 01:39:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-10-11 01:39:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 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-10-11 01:39:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2024-10-11 01:39:40,006 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 15 [2024-10-11 01:39:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2024-10-11 01:39:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2024-10-11 01:39:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:40,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:40,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:40,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:39:40,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:40,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 41573398, now seen corresponding path program 1 times [2024-10-11 01:39:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621009364] [2024-10-11 01:39:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621009364] [2024-10-11 01:39:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621009364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:39:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580450339] [2024-10-11 01:39:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:39:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:39:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:39:40,622 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:40,902 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2024-10-11 01:39:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:40,905 INFO L225 Difference]: With dead ends: 84 [2024-10-11 01:39:40,907 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 01:39:40,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:39:40,908 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 90 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:40,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 68 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 01:39:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2024-10-11 01:39:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-10-11 01:39:40,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 15 [2024-10-11 01:39:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:40,921 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-10-11 01:39:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-10-11 01:39:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:40,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:40,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:40,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:39:40,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1818427802, now seen corresponding path program 1 times [2024-10-11 01:39:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:40,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082968613] [2024-10-11 01:39:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:41,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082968613] [2024-10-11 01:39:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082968613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259814661] [2024-10-11 01:39:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:41,095 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:41,235 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-10-11 01:39:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:39:41,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:41,237 INFO L225 Difference]: With dead ends: 80 [2024-10-11 01:39:41,237 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 01:39:41,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:39:41,238 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:41,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 70 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 01:39:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2024-10-11 01:39:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-10-11 01:39:41,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 15 [2024-10-11 01:39:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:41,256 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-10-11 01:39:41,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-10-11 01:39:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 01:39:41,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:41,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:41,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:39:41,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:41,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -570392850, now seen corresponding path program 1 times [2024-10-11 01:39:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3877110] [2024-10-11 01:39:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3877110] [2024-10-11 01:39:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3877110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:39:41,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634998823] [2024-10-11 01:39:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:41,451 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:41,655 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2024-10-11 01:39:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 01:39:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 01:39:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:41,657 INFO L225 Difference]: With dead ends: 96 [2024-10-11 01:39:41,657 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 01:39:41,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:39:41,659 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:41,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 119 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 01:39:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 45. [2024-10-11 01:39:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-11 01:39:41,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 16 [2024-10-11 01:39:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:41,680 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-11 01:39:41,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-11 01:39:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 01:39:41,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:41,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:41,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:39:41,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1206461554, now seen corresponding path program 1 times [2024-10-11 01:39:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652299854] [2024-10-11 01:39:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652299854] [2024-10-11 01:39:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652299854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:41,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626645111] [2024-10-11 01:39:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:41,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:41,862 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:42,057 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2024-10-11 01:39:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:39:42,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 01:39:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:42,059 INFO L225 Difference]: With dead ends: 78 [2024-10-11 01:39:42,059 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 01:39:42,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:39:42,060 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:42,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 92 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 01:39:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2024-10-11 01:39:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-11 01:39:42,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 16 [2024-10-11 01:39:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-11 01:39:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-11 01:39:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:39:42,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:42,074 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:42,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:39:42,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:39:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1822439760, now seen corresponding path program 1 times [2024-10-11 01:39:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515477263] [2024-10-11 01:39:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515477263] [2024-10-11 01:39:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515477263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593875139] [2024-10-11 01:39:43,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:43,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:43,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:39:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:43,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 01:39:43,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:43,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:39:43,256 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 01:39:43,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 01:39:43,270 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 43 treesize of output 11 [2024-10-11 01:39:43,277 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 35 treesize of output 19 [2024-10-11 01:39:43,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,445 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-11 01:39:43,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2024-10-11 01:39:43,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-10-11 01:39:43,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,483 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-11 01:39:43,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2024-10-11 01:39:43,520 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-10-11 01:39:43,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2024-10-11 01:39:43,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:39:43,622 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-11 01:39:43,623 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 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-11 01:39:43,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,784 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-10-11 01:39:43,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 93 [2024-10-11 01:39:43,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:43,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2024-10-11 01:39:43,869 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 20 treesize of output 1 [2024-10-11 01:39:43,908 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-10-11 01:39:43,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2024-10-11 01:39:43,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-10-11 01:39:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:44,345 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-11 01:39:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 41 [2024-10-11 01:39:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:44,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:44,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:44,568 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2024-10-11 01:39:44,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:44,578 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2024-10-11 01:39:50,226 INFO L349 Elim1Store]: treesize reduction 1840, result has 37.9 percent of original size [2024-10-11 01:39:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 44862 treesize of output 41902 [2024-10-11 01:39:52,925 INFO L349 Elim1Store]: treesize reduction 1652, result has 39.2 percent of original size [2024-10-11 01:39:52,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 132867 treesize of output 98200 [2024-10-11 01:39:55,541 INFO L349 Elim1Store]: treesize reduction 68, result has 70.6 percent of original size [2024-10-11 01:39:55,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 12315 treesize of output 11562 [2024-10-11 01:39:56,329 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 7201 treesize of output 6993 [2024-10-11 01:39:56,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:56,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:56,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 6964 treesize of output 6559 [2024-10-11 01:39:57,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:57,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6558 treesize of output 6075 [2024-10-11 01:39:57,479 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 6333 treesize of output 6125 [2024-10-11 01:39:58,384 INFO L349 Elim1Store]: treesize reduction 440, result has 34.0 percent of original size [2024-10-11 01:39:58,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 7636 treesize of output 7572 [2024-10-11 01:39:58,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:58,775 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 7002 treesize of output 6556 [2024-10-11 01:39:59,418 INFO L349 Elim1Store]: treesize reduction 68, result has 70.6 percent of original size [2024-10-11 01:39:59,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5869 treesize of output 5892 [2024-10-11 01:39:59,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5475 treesize of output 5234 [2024-10-11 01:40:00,551 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 6177 treesize of output 5849 [2024-10-11 01:40:01,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:01,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 4988 treesize of output 4907 [2024-10-11 01:40:22,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4