./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-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:02:17,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:02:17,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:02:17,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:02:17,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:02:17,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:02:17,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:02:17,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:02:17,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:02:17,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:02:17,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:02:17,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:02:17,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:02:17,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:02:17,255 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:02:17,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:02:17,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:02:17,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:02:17,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:02:17,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:02:17,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:02:17,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:02:17,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:02:17,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:02:17,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:02:17,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:02:17,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:02:17,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:02:17,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:02:17,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:02:17,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:02:17,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:02:17,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2024-10-11 03:02:17,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:02:17,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:02:17,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:02:17,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:02:17,507 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:02:17,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-10-11 03:02:18,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:02:18,925 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:02:18,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-10-11 03:02:18,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2defd925/085e671442404237a1aa2270e7937175/FLAG5f87b167c [2024-10-11 03:02:19,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2defd925/085e671442404237a1aa2270e7937175 [2024-10-11 03:02:19,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:02:19,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:02:19,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:02:19,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:02:19,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:02:19,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e739717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19, skipping insertion in model container [2024-10-11 03:02:19,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:02:19,497 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-simple/fibo_10-1.c[743,756] [2024-10-11 03:02:19,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:02:19,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:02:19,520 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-simple/fibo_10-1.c[743,756] [2024-10-11 03:02:19,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:02:19,538 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:02:19,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19 WrapperNode [2024-10-11 03:02:19,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:02:19,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:02:19,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:02:19,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:02:19,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,567 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-11 03:02:19,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:02:19,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:02:19,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:02:19,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:02:19,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,590 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-11 03:02:19,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:02:19,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:02:19,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:02:19,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:02:19,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (1/1) ... [2024-10-11 03:02:19,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:02:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:19,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:02:19,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:02:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:02:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:02:19,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:02:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:02:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-10-11 03:02:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-10-11 03:02:19,749 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:02:19,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:02:19,851 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-11 03:02:19,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:02:19,871 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:02:19,871 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:02:19,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:19 BoogieIcfgContainer [2024-10-11 03:02:19,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:02:19,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:02:19,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:02:19,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:02:19,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:02:19" (1/3) ... [2024-10-11 03:02:19,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecb5fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:02:19, skipping insertion in model container [2024-10-11 03:02:19,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:19" (2/3) ... [2024-10-11 03:02:19,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecb5fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:02:19, skipping insertion in model container [2024-10-11 03:02:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:19" (3/3) ... [2024-10-11 03:02:19,893 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2024-10-11 03:02:19,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:02:19,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:02:19,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:02:19,982 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;@310b0931, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:02:19,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:02:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:02:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:02:19,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:19,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:19,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2024-10-11 03:02:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663237817] [2024-10-11 03:02:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:02:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663237817] [2024-10-11 03:02:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663237817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:02:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:02:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:02:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945306056] [2024-10-11 03:02:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:02:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:02:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:02:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:02:20,288 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-11 03:02:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:20,328 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-11 03:02:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:02:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-10-11 03:02:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:20,340 INFO L225 Difference]: With dead ends: 25 [2024-10-11 03:02:20,341 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 03:02:20,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:02:20,346 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:20,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:02:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 03:02:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 03:02:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 03:02:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-11 03:02:20,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-10-11 03:02:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:20,382 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-11 03:02:20,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-11 03:02:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-11 03:02:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:02:20,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:20,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:20,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:02:20,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:20,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2024-10-11 03:02:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140602064] [2024-10-11 03:02:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:02:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140602064] [2024-10-11 03:02:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140602064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:02:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:02:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:02:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655505938] [2024-10-11 03:02:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:02:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:02:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:02:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:02:20,473 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-11 03:02:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:20,496 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-11 03:02:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:02:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-11 03:02:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:20,498 INFO L225 Difference]: With dead ends: 23 [2024-10-11 03:02:20,498 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 03:02:20,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:02:20,500 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:20,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:02:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 03:02:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-11 03:02:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 03:02:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-11 03:02:20,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-10-11 03:02:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-11 03:02:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-11 03:02:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-11 03:02:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:02:20,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:20,513 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:20,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:02:20,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:20,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:20,514 INFO L85 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2024-10-11 03:02:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484218573] [2024-10-11 03:02:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:02:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:02:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484218573] [2024-10-11 03:02:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484218573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:20,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844129106] [2024-10-11 03:02:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:20,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:02:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:02:20,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:02:20,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:02:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844129106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:20,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-10-11 03:02:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744194475] [2024-10-11 03:02:20,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:02:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:02:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:02:20,997 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:02:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:21,076 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-10-11 03:02:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:02:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-10-11 03:02:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:21,077 INFO L225 Difference]: With dead ends: 34 [2024-10-11 03:02:21,077 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 03:02:21,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:02:21,079 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:21,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 03:02:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 03:02:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 03:02:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-11 03:02:21,085 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2024-10-11 03:02:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:21,086 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-11 03:02:21,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:02:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-11 03:02:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:02:21,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:21,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:21,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:02:21,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:21,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:21,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2024-10-11 03:02:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789221775] [2024-10-11 03:02:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:02:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789221775] [2024-10-11 03:02:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789221775] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698352302] [2024-10-11 03:02:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:21,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:21,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:02:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:21,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:02:21,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:02:21,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:02:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698352302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:21,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-10-11 03:02:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251457621] [2024-10-11 03:02:21,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:21,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:02:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:02:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:02:21,689 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:02:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:21,809 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-10-11 03:02:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:02:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-10-11 03:02:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:21,812 INFO L225 Difference]: With dead ends: 37 [2024-10-11 03:02:21,812 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 03:02:21,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:02:21,814 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:21,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 03:02:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 03:02:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 03:02:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-11 03:02:21,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2024-10-11 03:02:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-11 03:02:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:02:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-11 03:02:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:02:21,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:21,825 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:21,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:02:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:22,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:22,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2024-10-11 03:02:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279400041] [2024-10-11 03:02:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:02:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:22,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279400041] [2024-10-11 03:02:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279400041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:22,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918395696] [2024-10-11 03:02:22,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:02:22,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:22,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:22,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:02:22,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:02:22,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:22,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:02:22,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 03:02:22,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:02:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918395696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:22,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-10-11 03:02:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249852014] [2024-10-11 03:02:22,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:02:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:02:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:02:22,607 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 03:02:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:22,766 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-10-11 03:02:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:02:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 36 [2024-10-11 03:02:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:22,768 INFO L225 Difference]: With dead ends: 68 [2024-10-11 03:02:22,768 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 03:02:22,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:02:22,769 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:22,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 03:02:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 03:02:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 03:02:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-10-11 03:02:22,779 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 36 [2024-10-11 03:02:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-10-11 03:02:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 03:02:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-10-11 03:02:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:02:22,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:22,783 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:22,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:02:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:22,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -867130448, now seen corresponding path program 3 times [2024-10-11 03:02:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460163578] [2024-10-11 03:02:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-11 03:02:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460163578] [2024-10-11 03:02:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460163578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110585341] [2024-10-11 03:02:23,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:02:23,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:23,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:23,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:23,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:02:23,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 03:02:23,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:23,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:02:23,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-10-11 03:02:23,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-11 03:02:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110585341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:23,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:23,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-10-11 03:02:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243439312] [2024-10-11 03:02:23,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:23,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:02:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:02:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:02:23,846 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:02:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:24,127 INFO L93 Difference]: Finished difference Result 88 states and 132 transitions. [2024-10-11 03:02:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:02:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 92 [2024-10-11 03:02:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:24,130 INFO L225 Difference]: With dead ends: 88 [2024-10-11 03:02:24,130 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 03:02:24,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:02:24,132 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:24,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 100 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 03:02:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-11 03:02:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-11 03:02:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-11 03:02:24,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 92 [2024-10-11 03:02:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-11 03:02:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:02:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-11 03:02:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 03:02:24,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:24,143 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:24,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:02:24,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:02:24,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1193756999, now seen corresponding path program 4 times [2024-10-11 03:02:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:24,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730648297] [2024-10-11 03:02:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-10-11 03:02:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730648297] [2024-10-11 03:02:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730648297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222857515] [2024-10-11 03:02:24,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:02:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:24,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:24,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:02:24,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:02:24,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:24,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:02:24,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-11 03:02:25,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 03:02:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222857515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:26,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:26,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 30 [2024-10-11 03:02:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633779952] [2024-10-11 03:02:26,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 03:02:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:26,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 03:02:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:02:26,188 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-11 03:02:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:26,451 INFO L93 Difference]: Finished difference Result 115 states and 178 transitions. [2024-10-11 03:02:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:02:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) Word has length 132 [2024-10-11 03:02:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:26,453 INFO L225 Difference]: With dead ends: 115 [2024-10-11 03:02:26,453 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 03:02:26,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 281 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 03:02:26,455 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:26,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 116 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 03:02:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-11 03:02:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 45 states have internal predecessors, (49), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-11 03:02:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-11 03:02:26,463 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2024-10-11 03:02:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-11 03:02:26,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-11 03:02:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-11 03:02:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:02:26,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:26,468 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:26,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:02:26,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:26,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2122090202, now seen corresponding path program 5 times [2024-10-11 03:02:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441390517] [2024-10-11 03:02:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-11 03:02:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441390517] [2024-10-11 03:02:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441390517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698958083] [2024-10-11 03:02:27,172 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:02:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:27,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:27,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:02:27,267 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-11 03:02:27,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:27,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:02:27,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2024-10-11 03:02:27,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-10-11 03:02:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698958083] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:27,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 21 [2024-10-11 03:02:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389748513] [2024-10-11 03:02:27,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:27,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:02:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:02:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:02:27,828 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 21 states, 19 states have (on average 2.789473684210526) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) [2024-10-11 03:02:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:27,968 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2024-10-11 03:02:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:02:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.789473684210526) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) Word has length 173 [2024-10-11 03:02:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:27,972 INFO L225 Difference]: With dead ends: 182 [2024-10-11 03:02:27,974 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 03:02:27,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:02:27,975 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:27,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 76 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 03:02:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-10-11 03:02:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 109 states have internal predecessors, (120), 33 states have call successors, (33), 19 states have call predecessors, (33), 18 states have return successors, (86), 37 states have call predecessors, (86), 33 states have call successors, (86) [2024-10-11 03:02:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2024-10-11 03:02:28,009 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2024-10-11 03:02:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2024-10-11 03:02:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.789473684210526) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) [2024-10-11 03:02:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2024-10-11 03:02:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-11 03:02:28,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:28,016 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:28,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:02:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:02:28,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 6 times [2024-10-11 03:02:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349598265] [2024-10-11 03:02:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1307 proven. 1260 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2024-10-11 03:02:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349598265] [2024-10-11 03:02:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349598265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851942371] [2024-10-11 03:02:29,312 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:02:29,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:29,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:29,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:29,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:02:29,413 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-11 03:02:29,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:29,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:02:29,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 346 proven. 1004 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2024-10-11 03:02:29,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 350 proven. 1040 refuted. 0 times theorem prover too weak. 4649 trivial. 0 not checked. [2024-10-11 03:02:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851942371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:30,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 15] total 32 [2024-10-11 03:02:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740721300] [2024-10-11 03:02:30,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 03:02:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 03:02:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:02:30,705 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 32 states, 30 states have (on average 2.6) internal successors, (78), 32 states have internal predecessors, (78), 23 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (41), 23 states have call predecessors, (41), 23 states have call successors, (41) [2024-10-11 03:02:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:31,107 INFO L93 Difference]: Finished difference Result 278 states and 461 transitions. [2024-10-11 03:02:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 03:02:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.6) internal successors, (78), 32 states have internal predecessors, (78), 23 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (41), 23 states have call predecessors, (41), 23 states have call successors, (41) Word has length 323 [2024-10-11 03:02:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:31,110 INFO L225 Difference]: With dead ends: 278 [2024-10-11 03:02:31,110 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 03:02:31,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 730 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=624, Invalid=1926, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 03:02:31,112 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 117 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:31,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 173 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 03:02:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2024-10-11 03:02:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 66 states have internal predecessors, (71), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (41), 15 states have call predecessors, (41), 18 states have call successors, (41) [2024-10-11 03:02:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2024-10-11 03:02:31,127 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 323 [2024-10-11 03:02:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:31,127 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2024-10-11 03:02:31,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.6) internal successors, (78), 32 states have internal predecessors, (78), 23 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (41), 23 states have call predecessors, (41), 23 states have call successors, (41) [2024-10-11 03:02:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2024-10-11 03:02:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-10-11 03:02:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:31,144 INFO L215 NwaCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:31,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:31,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:31,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1941316495, now seen corresponding path program 7 times [2024-10-11 03:02:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466761803] [2024-10-11 03:02:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-11 03:02:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 03:02:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3423 proven. 3437 refuted. 0 times theorem prover too weak. 14131 trivial. 0 not checked. [2024-10-11 03:02:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466761803] [2024-10-11 03:02:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466761803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021770486] [2024-10-11 03:02:33,389 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 03:02:33,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:33,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:33,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:33,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:02:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:33,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:02:33,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 411 proven. 3108 refuted. 0 times theorem prover too weak. 17472 trivial. 0 not checked. [2024-10-11 03:02:33,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 411 proven. 3185 refuted. 0 times theorem prover too weak. 17395 trivial. 0 not checked. [2024-10-11 03:02:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021770486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:36,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 19] total 39 [2024-10-11 03:02:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652382584] [2024-10-11 03:02:36,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:36,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 03:02:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 03:02:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:02:36,306 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 31 states have call successors, (34), 1 states have call predecessors, (34), 15 states have return successors, (52), 27 states have call predecessors, (52), 31 states have call successors, (52) [2024-10-11 03:02:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:36,747 INFO L93 Difference]: Finished difference Result 221 states and 365 transitions. [2024-10-11 03:02:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 03:02:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 31 states have call successors, (34), 1 states have call predecessors, (34), 15 states have return successors, (52), 27 states have call predecessors, (52), 31 states have call successors, (52) Word has length 595 [2024-10-11 03:02:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:36,752 INFO L225 Difference]: With dead ends: 221 [2024-10-11 03:02:36,752 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 03:02:36,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1423 GetRequests, 1352 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=971, Invalid=3189, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 03:02:36,754 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 257 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:36,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 157 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 03:02:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2024-10-11 03:02:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.0375) internal successors, (83), 78 states have internal predecessors, (83), 22 states have call successors, (22), 17 states have call predecessors, (22), 10 states have return successors, (53), 17 states have call predecessors, (53), 22 states have call successors, (53) [2024-10-11 03:02:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-10-11 03:02:36,774 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 595 [2024-10-11 03:02:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:36,775 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-10-11 03:02:36,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 31 states have call successors, (34), 1 states have call predecessors, (34), 15 states have return successors, (52), 27 states have call predecessors, (52), 31 states have call successors, (52) [2024-10-11 03:02:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-10-11 03:02:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2024-10-11 03:02:36,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:36,788 INFO L215 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:36,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:02:36,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1994288690, now seen corresponding path program 8 times [2024-10-11 03:02:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243090475] [2024-10-11 03:02:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-11 03:02:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-10-11 03:02:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:38,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2024-10-11 03:02:39,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:39,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243090475] [2024-10-11 03:02:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243090475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:39,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445273359] [2024-10-11 03:02:39,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:02:39,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:39,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:39,057 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:39,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:02:39,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:02:39,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:39,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 1676 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:02:39,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2024-10-11 03:02:39,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2024-10-11 03:02:42,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445273359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:42,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:42,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 21] total 31 [2024-10-11 03:02:42,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752047535] [2024-10-11 03:02:42,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:42,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:02:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:02:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:02:42,557 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 28 states have call successors, (29), 1 states have call predecessors, (29), 10 states have return successors, (43), 18 states have call predecessors, (43), 28 states have call successors, (43) [2024-10-11 03:02:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:42,757 INFO L93 Difference]: Finished difference Result 469 states and 720 transitions. [2024-10-11 03:02:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:02:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 28 states have call successors, (29), 1 states have call predecessors, (29), 10 states have return successors, (43), 18 states have call predecessors, (43), 28 states have call successors, (43) Word has length 745 [2024-10-11 03:02:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:42,765 INFO L225 Difference]: With dead ends: 469 [2024-10-11 03:02:42,765 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 03:02:42,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1726 GetRequests, 1686 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:02:42,766 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 113 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 03:02:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 444. [2024-10-11 03:02:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 306 states have (on average 1.0326797385620916) internal successors, (316), 300 states have internal predecessors, (316), 98 states have call successors, (98), 61 states have call predecessors, (98), 39 states have return successors, (261), 82 states have call predecessors, (261), 98 states have call successors, (261) [2024-10-11 03:02:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 675 transitions. [2024-10-11 03:02:42,804 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 675 transitions. Word has length 745 [2024-10-11 03:02:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:42,806 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 675 transitions. [2024-10-11 03:02:42,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 28 states have call successors, (29), 1 states have call predecessors, (29), 10 states have return successors, (43), 18 states have call predecessors, (43), 28 states have call successors, (43) [2024-10-11 03:02:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 675 transitions. [2024-10-11 03:02:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2024-10-11 03:02:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:42,816 INFO L215 NwaCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:42,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:02:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:43,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash -465530645, now seen corresponding path program 9 times [2024-10-11 03:02:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554630287] [2024-10-11 03:02:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:02:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-11 03:02:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-10-11 03:02:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2024-10-11 03:02:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:47,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:02:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-11 03:02:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-10-11 03:02:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:02:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:02:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:02:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:02:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:02:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 11272 proven. 11575 refuted. 0 times theorem prover too weak. 92731 trivial. 0 not checked. [2024-10-11 03:02:48,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554630287] [2024-10-11 03:02:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554630287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077743611] [2024-10-11 03:02:48,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:02:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:48,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:48,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:02:48,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2024-10-11 03:02:48,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:48,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:02:48,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 9568 proven. 1014 refuted. 0 times theorem prover too weak. 104996 trivial. 0 not checked. [2024-10-11 03:02:48,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 9572 proven. 1059 refuted. 0 times theorem prover too weak. 104947 trivial. 0 not checked. [2024-10-11 03:02:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077743611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:52,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 21] total 47 [2024-10-11 03:02:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489990057] [2024-10-11 03:02:52,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 03:02:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 03:02:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1675, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 03:02:52,626 INFO L87 Difference]: Start difference. First operand 444 states and 675 transitions. Second operand has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 29 states have call successors, (40), 1 states have call predecessors, (40), 18 states have return successors, (60), 39 states have call predecessors, (60), 29 states have call successors, (60) [2024-10-11 03:02:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:53,354 INFO L93 Difference]: Finished difference Result 637 states and 1114 transitions. [2024-10-11 03:02:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 03:02:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 29 states have call successors, (40), 1 states have call predecessors, (40), 18 states have return successors, (60), 39 states have call predecessors, (60), 29 states have call successors, (60) Word has length 1385 [2024-10-11 03:02:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:53,358 INFO L225 Difference]: With dead ends: 637 [2024-10-11 03:02:53,359 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 03:02:53,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3254 GetRequests, 3165 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1399, Invalid=5081, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 03:02:53,363 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 212 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:53,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 332 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:02:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 03:02:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 148. [2024-10-11 03:02:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 103 states have internal predecessors, (108), 31 states have call successors, (31), 24 states have call predecessors, (31), 11 states have return successors, (78), 20 states have call predecessors, (78), 31 states have call successors, (78) [2024-10-11 03:02:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-10-11 03:02:53,376 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 1385 [2024-10-11 03:02:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:53,377 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-10-11 03:02:53,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 29 states have call successors, (40), 1 states have call predecessors, (40), 18 states have return successors, (60), 39 states have call predecessors, (60), 29 states have call successors, (60) [2024-10-11 03:02:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-10-11 03:02:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-10-11 03:02:53,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:53,383 INFO L215 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:53,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:02:53,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1347613546, now seen corresponding path program 10 times [2024-10-11 03:02:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324140389] [2024-10-11 03:02:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:02:53,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:02:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:02:53,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:02:53,933 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:02:53,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:02:53,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:02:53,937 INFO L407 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2024-10-11 03:02:54,071 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:02:54,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:02:54 BoogieIcfgContainer [2024-10-11 03:02:54,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:02:54,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:02:54,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:02:54,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:02:54,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:19" (3/4) ... [2024-10-11 03:02:54,076 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:02:54,179 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:02:54,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:02:54,180 INFO L158 Benchmark]: Toolchain (without parser) took 34845.48ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 92.4MB in the beginning and 478.4MB in the end (delta: -385.9MB). Peak memory consumption was 499.8MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,180 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:02:54,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.14ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 80.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 146.8MB. Free memory was 80.3MB in the beginning and 79.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,180 INFO L158 Benchmark]: Boogie Preprocessor took 27.73ms. Allocated memory is still 146.8MB. Free memory was 78.9MB in the beginning and 77.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:02:54,181 INFO L158 Benchmark]: RCFGBuilder took 271.27ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 116.1MB in the end (delta: -38.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,181 INFO L158 Benchmark]: TraceAbstraction took 34191.07ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 169.0MB in the beginning and 498.3MB in the end (delta: -329.3MB). Peak memory consumption was 502.3MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,181 INFO L158 Benchmark]: Witness Printer took 104.97ms. Allocated memory is still 1.0GB. Free memory was 498.3MB in the beginning and 478.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 03:02:54,182 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.14ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.14ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 80.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 146.8MB. Free memory was 80.3MB in the beginning and 79.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.73ms. Allocated memory is still 146.8MB. Free memory was 78.9MB in the beginning and 77.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.27ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 116.1MB in the end (delta: -38.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 34191.07ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 169.0MB in the beginning and 498.3MB in the end (delta: -329.3MB). Peak memory consumption was 502.3MB. Max. memory is 16.1GB. * Witness Printer took 104.97ms. Allocated memory is still 1.0GB. Free memory was 498.3MB in the beginning and 478.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [x=10] [L29] reach_error() VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 13, TraceHistogramMax: 203, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 1356 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 1005 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2947 IncrementalHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1005 mSolverCounterUnsat, 241 mSDtfsCounter, 2947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8380 GetRequests, 7964 SyntacticMatches, 58 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6429 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=11, InterpolantAutomatonStates: 243, 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, 12 MinimizatonAttempts, 147 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 8279 NumberOfCodeBlocks, 7419 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 10565 ConstructedInterpolants, 0 QuantifiedInterpolants, 14581 SizeOfPredicates, 43 NumberOfNonLiveVariables, 6105 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 494330/536370 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 03:02:54,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE