./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:11:17,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:11:17,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:11:17,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:11:17,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:11:17,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:11:17,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:11:17,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:11:17,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:11:17,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:11:17,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:11:17,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:11:17,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:11:17,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:11:17,293 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:11:17,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:11:17,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:11:17,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:11:17,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:11:17,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:11:17,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:11:17,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:11:17,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:11:17,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:11:17,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:11:17,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:11:17,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:11:17,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:11:17,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:11:17,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:11:17,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:11:17,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:11:17,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:11:17,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:11:17,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:11:17,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:11:17,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:11:17,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:11:17,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:11:17,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:11:17,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:11:17,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:11:17,313 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 ! 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2024-10-14 03:11:17,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:11:17,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:11:17,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:11:17,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:11:17,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:11:17,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2024-10-14 03:11:19,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:11:19,284 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:11:19,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2024-10-14 03:11:19,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3515a9774/edd2e27019654f01908eb1ac6d46dc78/FLAGf86848b7e [2024-10-14 03:11:19,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3515a9774/edd2e27019654f01908eb1ac6d46dc78 [2024-10-14 03:11:19,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:11:19,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:11:19,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:11:19,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:11:19,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:11:19,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dc905f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19, skipping insertion in model container [2024-10-14 03:11:19,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:11:19,526 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/recursive/Ackermann04.c[1166,1179] [2024-10-14 03:11:19,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:11:19,542 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:11:19,558 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/recursive/Ackermann04.c[1166,1179] [2024-10-14 03:11:19,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:11:19,577 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:11:19,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19 WrapperNode [2024-10-14 03:11:19,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:11:19,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:11:19,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:11:19,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:11:19,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,613 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-10-14 03:11:19,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:11:19,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:11:19,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:11:19,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:11:19,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,650 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:11:19,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:11:19,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:11:19,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:11:19,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:11:19,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (1/1) ... [2024-10-14 03:11:19,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:11:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:19,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:11:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:11:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:11:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:11:19,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:11:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-10-14 03:11:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-10-14 03:11:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:11:19,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:11:19,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:11:20,003 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 03:11:20,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:11:20,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:11:20,034 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:11:20,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:20 BoogieIcfgContainer [2024-10-14 03:11:20,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:11:20,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:11:20,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:11:20,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:11:20,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:11:19" (1/3) ... [2024-10-14 03:11:20,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676708b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:11:20, skipping insertion in model container [2024-10-14 03:11:20,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:19" (2/3) ... [2024-10-14 03:11:20,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676708b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:11:20, skipping insertion in model container [2024-10-14 03:11:20,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:20" (3/3) ... [2024-10-14 03:11:20,072 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2024-10-14 03:11:20,114 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:11:20,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:11:20,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:11:20,216 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;@5559927f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:11:20,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:11:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 03:11:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 03:11:20,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:20,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:20,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2024-10-14 03:11:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670053291] [2024-10-14 03:11:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:20,584 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-14 03:11:20,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670053291] [2024-10-14 03:11:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670053291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:11:20,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:11:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:11:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664149697] [2024-10-14 03:11:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:11:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:11:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:11:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:11:20,625 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:11:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:20,760 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2024-10-14 03:11:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:11:20,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 03:11:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:20,769 INFO L225 Difference]: With dead ends: 47 [2024-10-14 03:11:20,769 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 03:11:20,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:11:20,775 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:20,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 57 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 03:11:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-14 03:11:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:11:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 03:11:20,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2024-10-14 03:11:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:20,821 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 03:11:20,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:11:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 03:11:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:11:20,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:20,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:20,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:11:20,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2024-10-14 03:11:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865870418] [2024-10-14 03:11:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:11:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865870418] [2024-10-14 03:11:20,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865870418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322541243] [2024-10-14 03:11:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:20,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:20,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:20,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:20,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:11:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:21,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 03:11:21,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:11:21,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:11:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322541243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:21,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-14 03:11:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320716049] [2024-10-14 03:11:21,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:11:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:11:21,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:11:21,250 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 03:11:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:21,503 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-14 03:11:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:11:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 18 [2024-10-14 03:11:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:21,508 INFO L225 Difference]: With dead ends: 79 [2024-10-14 03:11:21,508 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 03:11:21,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:11:21,514 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:21,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:11:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 03:11:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-14 03:11:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2024-10-14 03:11:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-10-14 03:11:21,545 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 18 [2024-10-14 03:11:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:21,545 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-10-14 03:11:21,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 03:11:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2024-10-14 03:11:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:11:21,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:21,551 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:21,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:11:21,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:21,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:21,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1262121361, now seen corresponding path program 1 times [2024-10-14 03:11:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:21,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561042671] [2024-10-14 03:11:21,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 03:11:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561042671] [2024-10-14 03:11:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561042671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995694223] [2024-10-14 03:11:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:22,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:22,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:11:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:22,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:11:22,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-14 03:11:22,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 03:11:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995694223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-10-14 03:11:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205512325] [2024-10-14 03:11:23,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:11:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:11:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:11:23,173 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:11:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:23,308 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2024-10-14 03:11:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:11:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2024-10-14 03:11:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:23,311 INFO L225 Difference]: With dead ends: 119 [2024-10-14 03:11:23,312 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 03:11:23,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:11:23,317 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:23,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 03:11:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 03:11:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-14 03:11:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-14 03:11:23,332 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2024-10-14 03:11:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:23,333 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-14 03:11:23,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:11:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-14 03:11:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:11:23,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:23,336 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:23,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:11:23,540 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,SelfDestructingSolverStorable2 [2024-10-14 03:11:23,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1396423690, now seen corresponding path program 2 times [2024-10-14 03:11:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105932317] [2024-10-14 03:11:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:11:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-14 03:11:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105932317] [2024-10-14 03:11:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105932317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691562997] [2024-10-14 03:11:24,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:11:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:24,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:24,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:11:24,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:11:24,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:24,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:11:24,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-14 03:11:24,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-14 03:11:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691562997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:26,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2024-10-14 03:11:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257934954] [2024-10-14 03:11:26,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:11:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:11:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:11:26,143 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-10-14 03:11:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:26,654 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2024-10-14 03:11:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:11:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 78 [2024-10-14 03:11:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:26,661 INFO L225 Difference]: With dead ends: 118 [2024-10-14 03:11:26,662 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 03:11:26,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 03:11:26,667 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:26,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 134 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:11:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 03:11:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-14 03:11:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-10-14 03:11:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 03:11:26,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2024-10-14 03:11:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:26,694 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 03:11:26,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-10-14 03:11:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 03:11:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-14 03:11:26,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:26,700 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 17, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:26,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:11:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:26,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -449528186, now seen corresponding path program 3 times [2024-10-14 03:11:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833071817] [2024-10-14 03:11:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:11:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 259 proven. 381 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2024-10-14 03:11:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833071817] [2024-10-14 03:11:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833071817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493280036] [2024-10-14 03:11:27,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 03:11:27,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:27,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:27,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:27,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:11:27,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-14 03:11:27,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:27,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 03:11:27,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 572 proven. 22 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2024-10-14 03:11:28,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 572 proven. 30 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2024-10-14 03:11:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493280036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:29,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-10-14 03:11:29,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163540344] [2024-10-14 03:11:29,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 03:11:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 03:11:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:11:29,129 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-14 03:11:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:29,267 INFO L93 Difference]: Finished difference Result 112 states and 189 transitions. [2024-10-14 03:11:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:11:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) Word has length 184 [2024-10-14 03:11:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:29,270 INFO L225 Difference]: With dead ends: 112 [2024-10-14 03:11:29,270 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:11:29,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 410 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:11:29,272 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:29,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:11:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2024-10-14 03:11:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (25), 11 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-14 03:11:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-14 03:11:29,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 184 [2024-10-14 03:11:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:29,285 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-14 03:11:29,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-14 03:11:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-14 03:11:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:11:29,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:29,291 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:29,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 03:11:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:29,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1363865912, now seen corresponding path program 4 times [2024-10-14 03:11:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488161533] [2024-10-14 03:11:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:11:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 125 proven. 275 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 03:11:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488161533] [2024-10-14 03:11:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488161533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481573221] [2024-10-14 03:11:30,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 03:11:30,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:30,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:30,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:30,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:11:30,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 03:11:30,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:30,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:11:30,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 484 proven. 71 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-14 03:11:30,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 131 proven. 269 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 03:11:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481573221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:31,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 27 [2024-10-14 03:11:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177300721] [2024-10-14 03:11:31,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:11:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:11:31,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:11:31,739 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-14 03:11:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:32,264 INFO L93 Difference]: Finished difference Result 120 states and 193 transitions. [2024-10-14 03:11:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-14 03:11:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) Word has length 130 [2024-10-14 03:11:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:32,267 INFO L225 Difference]: With dead ends: 120 [2024-10-14 03:11:32,267 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 03:11:32,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 281 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 03:11:32,269 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:32,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 194 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:11:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 03:11:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-14 03:11:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-14 03:11:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-10-14 03:11:32,280 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 130 [2024-10-14 03:11:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:32,280 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-10-14 03:11:32,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-14 03:11:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-10-14 03:11:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:11:32,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:32,282 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:32,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:11:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:32,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1090473022, now seen corresponding path program 5 times [2024-10-14 03:11:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704901998] [2024-10-14 03:11:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:11:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 152 proven. 295 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-10-14 03:11:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704901998] [2024-10-14 03:11:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704901998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867732949] [2024-10-14 03:11:33,181 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 03:11:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:33,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:33,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:33,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:11:33,303 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-14 03:11:33,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:33,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 03:11:33,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-14 03:11:33,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-14 03:11:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867732949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:34,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:34,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 24 [2024-10-14 03:11:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026170718] [2024-10-14 03:11:34,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:34,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 03:11:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 03:11:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-10-14 03:11:34,976 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-14 03:11:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:35,468 INFO L93 Difference]: Finished difference Result 134 states and 211 transitions. [2024-10-14 03:11:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 03:11:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 130 [2024-10-14 03:11:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:35,471 INFO L225 Difference]: With dead ends: 134 [2024-10-14 03:11:35,472 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 03:11:35,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 280 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 03:11:35,478 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:35,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 208 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:11:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 03:11:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-10-14 03:11:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (32), 15 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-14 03:11:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-10-14 03:11:35,517 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 130 [2024-10-14 03:11:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:35,517 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-10-14 03:11:35,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-14 03:11:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-10-14 03:11:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 03:11:35,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:35,522 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:35,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:11:35,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:35,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:35,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -511219076, now seen corresponding path program 6 times [2024-10-14 03:11:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:35,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045170406] [2024-10-14 03:11:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:11:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-10-14 03:11:36,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045170406] [2024-10-14 03:11:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045170406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656480376] [2024-10-14 03:11:36,873 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 03:11:36,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:36,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:36,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 03:11:37,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-10-14 03:11:37,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:37,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 03:11:37,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-10-14 03:11:37,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-14 03:11:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656480376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:40,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:40,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2024-10-14 03:11:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009000035] [2024-10-14 03:11:40,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:40,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 03:11:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 03:11:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 03:11:40,959 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-10-14 03:11:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:41,704 INFO L93 Difference]: Finished difference Result 154 states and 245 transitions. [2024-10-14 03:11:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-14 03:11:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 156 [2024-10-14 03:11:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:41,707 INFO L225 Difference]: With dead ends: 154 [2024-10-14 03:11:41,710 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 03:11:41,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 331 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2024-10-14 03:11:41,713 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:41,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 257 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:11:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 03:11:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-14 03:11:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (43), 19 states have call predecessors, (43), 14 states have call successors, (43) [2024-10-14 03:11:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2024-10-14 03:11:41,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 156 [2024-10-14 03:11:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:41,740 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2024-10-14 03:11:41,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-10-14 03:11:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2024-10-14 03:11:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 03:11:41,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:41,743 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:41,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 03:11:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:41,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2140695240, now seen corresponding path program 7 times [2024-10-14 03:11:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085878543] [2024-10-14 03:11:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:11:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:11:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:11:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2024-10-14 03:11:43,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085878543] [2024-10-14 03:11:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085878543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819825361] [2024-10-14 03:11:43,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-14 03:11:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:43,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:43,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 03:11:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:43,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 03:11:43,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-10-14 03:11:43,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-10-14 03:11:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819825361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:50,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2024-10-14 03:11:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625717238] [2024-10-14 03:11:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 03:11:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 03:11:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 03:11:50,212 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-10-14 03:11:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:51,389 INFO L93 Difference]: Finished difference Result 133 states and 215 transitions. [2024-10-14 03:11:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 03:11:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 182 [2024-10-14 03:11:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:51,392 INFO L225 Difference]: With dead ends: 133 [2024-10-14 03:11:51,392 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 03:11:51,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 389 SyntacticMatches, 20 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1027, Invalid=4673, Unknown=0, NotChecked=0, Total=5700 [2024-10-14 03:11:51,395 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:51,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:11:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 03:11:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2024-10-14 03:11:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 6 states have call predecessors, (15), 16 states have return successors, (64), 24 states have call predecessors, (64), 15 states have call successors, (64) [2024-10-14 03:11:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-10-14 03:11:51,416 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 182 [2024-10-14 03:11:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:51,417 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-10-14 03:11:51,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-10-14 03:11:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-10-14 03:11:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 03:11:51,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:51,419 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:51,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 03:11:51,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 03:11:51,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1922447937, now seen corresponding path program 8 times [2024-10-14 03:11:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637284556] [2024-10-14 03:11:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:11:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:11:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:11:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:11:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:11:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2024-10-14 03:11:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637284556] [2024-10-14 03:11:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637284556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716459682] [2024-10-14 03:11:52,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:11:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:52,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:11:52,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 03:11:53,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:11:53,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:53,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 03:11:53,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-14 03:11:53,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-14 03:11:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716459682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:57,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2024-10-14 03:11:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636749916] [2024-10-14 03:11:57,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 03:11:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 03:11:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:11:57,021 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-14 03:11:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:57,747 INFO L93 Difference]: Finished difference Result 190 states and 340 transitions. [2024-10-14 03:11:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-14 03:11:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 169 [2024-10-14 03:11:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:57,749 INFO L225 Difference]: With dead ends: 190 [2024-10-14 03:11:57,749 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:11:57,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 360 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2024-10-14 03:11:57,753 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:57,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 171 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:11:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:11:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:11:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-14 03:11:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:11:57,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2024-10-14 03:11:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:57,755 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:11:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-14 03:11:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:11:57,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:11:57,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:11:57,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 03:11:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:11:57,963 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-10-14 03:11:57,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:12:00,982 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:12:01,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:12:01 BoogieIcfgContainer [2024-10-14 03:12:01,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:12:01,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:12:01,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:12:01,013 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:12:01,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:20" (3/4) ... [2024-10-14 03:12:01,016 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 03:12:01,020 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-10-14 03:12:01,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 03:12:01,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 03:12:01,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 03:12:01,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:12:01,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:12:01,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 03:12:01,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:12:01,104 INFO L158 Benchmark]: Toolchain (without parser) took 41783.00ms. Allocated memory was 169.9MB in the beginning and 627.0MB in the end (delta: 457.2MB). Free memory was 120.6MB in the beginning and 497.9MB in the end (delta: -377.3MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,104 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:12:01,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.19ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 109.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.94ms. Allocated memory is still 169.9MB. Free memory was 108.7MB in the beginning and 107.8MB in the end (delta: 887.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:12:01,105 INFO L158 Benchmark]: Boogie Preprocessor took 48.55ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 106.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,105 INFO L158 Benchmark]: RCFGBuilder took 371.28ms. Allocated memory is still 169.9MB. Free memory was 106.0MB in the beginning and 94.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,105 INFO L158 Benchmark]: TraceAbstraction took 40975.88ms. Allocated memory was 169.9MB in the beginning and 627.0MB in the end (delta: 457.2MB). Free memory was 94.0MB in the beginning and 502.1MB in the end (delta: -408.1MB). Peak memory consumption was 333.8MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,105 INFO L158 Benchmark]: Witness Printer took 90.15ms. Allocated memory is still 627.0MB. Free memory was 502.1MB in the beginning and 497.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:12:01,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.19ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 109.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.94ms. Allocated memory is still 169.9MB. Free memory was 108.7MB in the beginning and 107.8MB in the end (delta: 887.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.55ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 106.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.28ms. Allocated memory is still 169.9MB. Free memory was 106.0MB in the beginning and 94.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40975.88ms. Allocated memory was 169.9MB in the beginning and 627.0MB in the end (delta: 457.2MB). Free memory was 94.0MB in the beginning and 502.1MB in the end (delta: -408.1MB). Peak memory consumption was 333.8MB. Max. memory is 16.1GB. * Witness Printer took 90.15ms. Allocated memory is still 627.0MB. Free memory was 502.1MB in the beginning and 497.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1535 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1300 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4101 IncrementalHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 235 mSDtfsCounter, 4101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2819 GetRequests, 2349 SyntacticMatches, 82 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4931 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=9, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 2193 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6182 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2843 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 20441/24648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: (((((0 < m) || (n < \result)) && (((m == 0) || (n == 0)) || (0 < n))) && ((0 < m) || (m == 0))) && (((((((((((n == 0) && (2 <= \result)) && (m == 1)) || (((m == 1) && (3 <= \result)) && (n <= 1))) || (6 < \result)) || (((4 <= \result) && (n <= 2)) && (m == 1))) || ((n == 0) && (3 <= \result))) || (m < 1)) || (((n <= 3) && (5 <= \result)) && (m == 1))) || ((5 <= \result) && (n <= 1))) || (((n <= 4) && (\result == 6)) && (m == 1)))) RESULT: Ultimate proved your program to be correct! [2024-10-14 03:12:01,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE