./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_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:11:31,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:11:31,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:11:31,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:11:31,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:11:32,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:11:32,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:11:32,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:11:32,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:11:32,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:11:32,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:11:32,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:11:32,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:11:32,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:11:32,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:11:32,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:11:32,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:11:32,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:11:32,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:11:32,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:11:32,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:11:32,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:11:32,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:11:32,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:11:32,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:11:32,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:11:32,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:11:32,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:11:32,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:11:32,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:11:32,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:11:32,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:11:32,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:11:32,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:11:32,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:11:32,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:11:32,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:11:32,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:11:32,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:11:32,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:11:32,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:11:32,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:11:32,032 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2024-11-19 22:11:32,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:11:32,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:11:32,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:11:32,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:11:32,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:11:32,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-19 22:11:33,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:11:33,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:11:33,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-19 22:11:33,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c119b1617/367a5b1a148c495da67e97dde9985bde/FLAG1e6ff30f4 [2024-11-19 22:11:34,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c119b1617/367a5b1a148c495da67e97dde9985bde [2024-11-19 22:11:34,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:11:34,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:11:34,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:11:34,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:11:34,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:11:34,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cba94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34, skipping insertion in model container [2024-11-19 22:11:34,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:11:34,602 WARN L250 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_2calls_8-2.c[947,960] [2024-11-19 22:11:34,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:11:34,625 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:11:34,639 WARN L250 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_2calls_8-2.c[947,960] [2024-11-19 22:11:34,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:11:34,654 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:11:34,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34 WrapperNode [2024-11-19 22:11:34,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:11:34,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:11:34,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:11:34,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:11:34,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,685 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-19 22:11:34,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:11:34,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:11:34,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:11:34,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:11:34,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,701 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-11-19 22:11:34,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:11:34,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:11:34,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:11:34,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:11:34,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (1/1) ... [2024-11-19 22:11:34,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:11:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:34,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:11:34,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:11:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:11:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:11:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-19 22:11:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-19 22:11:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-19 22:11:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-19 22:11:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:11:34,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:11:34,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:11:34,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:11:34,976 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 22:11:34,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:11:34,987 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:11:34,987 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:11:34,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:34 BoogieIcfgContainer [2024-11-19 22:11:34,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:11:34,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:11:34,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:11:34,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:11:34,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:11:34" (1/3) ... [2024-11-19 22:11:34,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de81aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:34, skipping insertion in model container [2024-11-19 22:11:34,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:34" (2/3) ... [2024-11-19 22:11:34,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de81aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:34, skipping insertion in model container [2024-11-19 22:11:34,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:34" (3/3) ... [2024-11-19 22:11:34,995 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2024-11-19 22:11:35,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:11:35,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:11:35,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:11:35,067 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;@7202636b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:11:35,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:11:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 22:11:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 22:11:35,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:35,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:35,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2024-11-19 22:11:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688420719] [2024-11-19 22:11:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:11:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688420719] [2024-11-19 22:11:35,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688420719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:11:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:11:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:11:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232934892] [2024-11-19 22:11:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:11:35,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:11:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:11:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:11:35,410 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-11-19 22:11:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:35,450 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-19 22:11:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:11:35,453 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-11-19 22:11:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:35,461 INFO L225 Difference]: With dead ends: 39 [2024-11-19 22:11:35,462 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 22:11:35,464 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-11-19 22:11:35,468 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:35,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:11:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 22:11:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 22:11:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 22:11:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-19 22:11:35,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-11-19 22:11:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:35,510 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-19 22:11:35,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-11-19 22:11:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-19 22:11:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 22:11:35,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:35,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:35,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:11:35,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2024-11-19 22:11:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651452630] [2024-11-19 22:11:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:11:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651452630] [2024-11-19 22:11:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651452630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:11:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:11:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:11:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764473263] [2024-11-19 22:11:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:11:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:11:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:11:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:11:35,667 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:11:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:35,694 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-19 22:11:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:11:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 22:11:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:35,696 INFO L225 Difference]: With dead ends: 33 [2024-11-19 22:11:35,696 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 22:11:35,697 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-11-19 22:11:35,699 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:35,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:11:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 22:11:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-19 22:11:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 22:11:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-19 22:11:35,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-11-19 22:11:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:35,713 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-19 22:11:35,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:11:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-19 22:11:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:11:35,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:35,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:35,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:11:35,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:35,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2024-11-19 22:11:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:35,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443920677] [2024-11-19 22:11:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:11:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443920677] [2024-11-19 22:11:35,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443920677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:35,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307213638] [2024-11-19 22:11:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:35,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:35,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:35,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:35,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:11:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:35,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:11:35,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:36,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307213638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:36,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-19 22:11:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315478554] [2024-11-19 22:11:36,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:36,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:11:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:11:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:11:36,375 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-11-19 22:11:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:36,539 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-11-19 22:11:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:11:36,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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 23 [2024-11-19 22:11:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:36,541 INFO L225 Difference]: With dead ends: 55 [2024-11-19 22:11:36,541 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 22:11:36,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 22:11:36,543 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:36,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 22:11:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-19 22:11:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 22:11:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-19 22:11:36,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-19 22:11:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:36,553 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-19 22:11:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-11-19 22:11:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-19 22:11:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:11:36,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:36,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:36,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:11:36,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:36,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:36,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2024-11-19 22:11:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723039288] [2024-11-19 22:11:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723039288] [2024-11-19 22:11:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723039288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302100510] [2024-11-19 22:11:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:36,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:36,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:36,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:36,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:11:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:11:37,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:37,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:11:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302100510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:37,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-19 22:11:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381911305] [2024-11-19 22:11:37,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:37,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:11:37,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:11:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:11:37,249 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-11-19 22:11:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:37,422 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2024-11-19 22:11:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:11:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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 24 [2024-11-19 22:11:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:37,425 INFO L225 Difference]: With dead ends: 53 [2024-11-19 22:11:37,425 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 22:11:37,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:11:37,427 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:37,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 120 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 22:11:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-19 22:11:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-19 22:11:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-19 22:11:37,437 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-11-19 22:11:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:37,438 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-19 22:11:37,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-11-19 22:11:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-19 22:11:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 22:11:37,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:37,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:37,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:11:37,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 22:11:37,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2024-11-19 22:11:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497588735] [2024-11-19 22:11:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:11:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 22:11:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 22:11:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497588735] [2024-11-19 22:11:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497588735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025901927] [2024-11-19 22:11:37,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:37,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:37,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:37,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:37,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:11:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:37,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:11:37,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:11:37,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:11:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025901927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:38,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-19 22:11:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519678864] [2024-11-19 22:11:38,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 22:11:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 22:11:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 22:11:38,352 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:11:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:38,565 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2024-11-19 22:11:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:11:38,565 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2024-11-19 22:11:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:38,567 INFO L225 Difference]: With dead ends: 109 [2024-11-19 22:11:38,567 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 22:11:38,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:11:38,569 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:38,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 22:11:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-19 22:11:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-19 22:11:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-19 22:11:38,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2024-11-19 22:11:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-19 22:11:38,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:11:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-19 22:11:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:11:38,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:38,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:38,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 22:11:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:38,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2024-11-19 22:11:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246581551] [2024-11-19 22:11:38,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 22:11:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246581551] [2024-11-19 22:11:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246581551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250510309] [2024-11-19 22:11:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:38,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:38,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:38,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:38,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 22:11:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:39,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:11:39,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 22:11:39,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:11:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250510309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:39,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-19 22:11:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22684198] [2024-11-19 22:11:39,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:39,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 22:11:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 22:11:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:11:39,432 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:11:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:39,723 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2024-11-19 22:11:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:11:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2024-11-19 22:11:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:39,727 INFO L225 Difference]: With dead ends: 179 [2024-11-19 22:11:39,727 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 22:11:39,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-19 22:11:39,729 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:39,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 255 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:11:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 22:11:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-19 22:11:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-11-19 22:11:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2024-11-19 22:11:39,752 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 37 [2024-11-19 22:11:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2024-11-19 22:11:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:11:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2024-11-19 22:11:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 22:11:39,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:39,755 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:39,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 22:11:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:39,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:39,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2024-11-19 22:11:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426631543] [2024-11-19 22:11:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:11:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 22:11:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426631543] [2024-11-19 22:11:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426631543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582362995] [2024-11-19 22:11:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:40,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:40,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:40,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 22:11:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:40,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 22:11:40,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 22:11:40,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 22:11:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582362995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:40,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-11-19 22:11:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301277193] [2024-11-19 22:11:40,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:40,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 22:11:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 22:11:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:11:40,807 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-19 22:11:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:41,110 INFO L93 Difference]: Finished difference Result 249 states and 486 transitions. [2024-11-19 22:11:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 22:11:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2024-11-19 22:11:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:41,114 INFO L225 Difference]: With dead ends: 249 [2024-11-19 22:11:41,114 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 22:11:41,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-11-19 22:11:41,116 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:41,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 223 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:11:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 22:11:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2024-11-19 22:11:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2024-11-19 22:11:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2024-11-19 22:11:41,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2024-11-19 22:11:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:41,138 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2024-11-19 22:11:41,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-19 22:11:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2024-11-19 22:11:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:11:41,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:41,141 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:41,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 22:11:41,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:41,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:41,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1851863125, now seen corresponding path program 1 times [2024-11-19 22:11:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:41,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213183581] [2024-11-19 22:11:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:41,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:11:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-19 22:11:41,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213183581] [2024-11-19 22:11:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213183581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751561091] [2024-11-19 22:11:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:41,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:41,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 22:11:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:41,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 22:11:41,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 22:11:41,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 22:11:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751561091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:42,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2024-11-19 22:11:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777470127] [2024-11-19 22:11:42,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 22:11:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 22:11:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-11-19 22:11:42,566 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 24 states have internal predecessors, (74), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-19 22:11:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:42,998 INFO L93 Difference]: Finished difference Result 253 states and 491 transitions. [2024-11-19 22:11:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 22:11:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 24 states have internal predecessors, (74), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2024-11-19 22:11:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:43,001 INFO L225 Difference]: With dead ends: 253 [2024-11-19 22:11:43,001 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 22:11:43,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 22:11:43,004 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:43,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 291 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:11:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 22:11:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-19 22:11:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (38), 19 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-19 22:11:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-19 22:11:43,017 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 79 [2024-11-19 22:11:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:43,017 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-19 22:11:43,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 24 states have internal predecessors, (74), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-19 22:11:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-19 22:11:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 22:11:43,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:43,022 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:43,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 22:11:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:43,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2024-11-19 22:11:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412835265] [2024-11-19 22:11:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:11:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 22:11:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2024-11-19 22:11:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412835265] [2024-11-19 22:11:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412835265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870654324] [2024-11-19 22:11:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:43,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:43,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:43,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 22:11:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:43,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 22:11:43,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-19 22:11:43,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-19 22:11:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870654324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:45,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2024-11-19 22:11:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421732570] [2024-11-19 22:11:45,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:45,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 22:11:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 22:11:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-19 22:11:45,090 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2024-11-19 22:11:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:45,595 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2024-11-19 22:11:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 22:11:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2024-11-19 22:11:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:45,598 INFO L225 Difference]: With dead ends: 226 [2024-11-19 22:11:45,600 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 22:11:45,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 319 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 22:11:45,602 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:45,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 360 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:11:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 22:11:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2024-11-19 22:11:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 74 states have internal predecessors, (89), 20 states have call successors, (20), 11 states have call predecessors, (20), 14 states have return successors, (51), 22 states have call predecessors, (51), 20 states have call successors, (51) [2024-11-19 22:11:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-11-19 22:11:45,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 148 [2024-11-19 22:11:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-11-19 22:11:45,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2024-11-19 22:11:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-11-19 22:11:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-19 22:11:45,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:45,636 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 22, 22, 19, 18, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 8, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:45,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 22:11:45,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:45,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash -502163779, now seen corresponding path program 1 times [2024-11-19 22:11:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:45,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302869600] [2024-11-19 22:11:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 22:11:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-19 22:11:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 22:11:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2932 backedges. 464 proven. 560 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2024-11-19 22:11:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302869600] [2024-11-19 22:11:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302869600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047741198] [2024-11-19 22:11:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:47,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:47,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:47,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:47,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 22:11:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:47,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 22:11:47,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2932 backedges. 96 proven. 672 refuted. 0 times theorem prover too weak. 2164 trivial. 0 not checked. [2024-11-19 22:11:47,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2932 backedges. 96 proven. 696 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2024-11-19 22:11:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047741198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:49,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:49,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 32 [2024-11-19 22:11:49,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666256653] [2024-11-19 22:11:49,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:49,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 22:11:49,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:49,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 22:11:49,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-11-19 22:11:49,377 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 25 states have call successors, (30), 1 states have call predecessors, (30), 13 states have return successors, (40), 19 states have call predecessors, (40), 25 states have call successors, (40) [2024-11-19 22:11:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:50,112 INFO L93 Difference]: Finished difference Result 267 states and 464 transitions. [2024-11-19 22:11:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 22:11:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 25 states have call successors, (30), 1 states have call predecessors, (30), 13 states have return successors, (40), 19 states have call predecessors, (40), 25 states have call successors, (40) Word has length 323 [2024-11-19 22:11:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:50,115 INFO L225 Difference]: With dead ends: 267 [2024-11-19 22:11:50,115 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 22:11:50,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 723 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=2055, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 22:11:50,117 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:50,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 495 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:11:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 22:11:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-19 22:11:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 22 states have call successors, (22), 13 states have call predecessors, (22), 16 states have return successors, (52), 25 states have call predecessors, (52), 22 states have call successors, (52) [2024-11-19 22:11:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-19 22:11:50,132 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 323 [2024-11-19 22:11:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:50,133 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-19 22:11:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 25 states have call successors, (30), 1 states have call predecessors, (30), 13 states have return successors, (40), 19 states have call predecessors, (40), 25 states have call successors, (40) [2024-11-19 22:11:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-19 22:11:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-19 22:11:50,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:50,139 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 29, 29, 25, 24, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 10, 9, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:50,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 22:11:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 22:11:50,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2144563242, now seen corresponding path program 2 times [2024-11-19 22:11:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807554231] [2024-11-19 22:11:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 22:11:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-19 22:11:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-19 22:11:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:11:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5028 backedges. 254 proven. 702 refuted. 0 times theorem prover too weak. 4072 trivial. 0 not checked. [2024-11-19 22:11:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807554231] [2024-11-19 22:11:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807554231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891151561] [2024-11-19 22:11:51,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 22:11:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:51,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:51,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 22:11:51,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 22:11:51,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:51,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 22:11:51,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5028 backedges. 202 proven. 698 refuted. 0 times theorem prover too weak. 4128 trivial. 0 not checked. [2024-11-19 22:11:51,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5028 backedges. 202 proven. 714 refuted. 0 times theorem prover too weak. 4112 trivial. 0 not checked. [2024-11-19 22:11:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891151561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:53,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 25 [2024-11-19 22:11:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928739200] [2024-11-19 22:11:53,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 22:11:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 22:11:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:11:53,469 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2024-11-19 22:11:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:53,935 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-19 22:11:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 22:11:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) Word has length 419 [2024-11-19 22:11:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:53,938 INFO L225 Difference]: With dead ends: 244 [2024-11-19 22:11:53,938 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 22:11:53,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 943 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 22:11:53,940 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:53,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 295 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:11:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 22:11:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-19 22:11:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.160919540229885) internal successors, (101), 86 states have internal predecessors, (101), 22 states have call successors, (22), 14 states have call predecessors, (22), 16 states have return successors, (51), 25 states have call predecessors, (51), 22 states have call successors, (51) [2024-11-19 22:11:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2024-11-19 22:11:53,966 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 419 [2024-11-19 22:11:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2024-11-19 22:11:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2024-11-19 22:11:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2024-11-19 22:11:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-19 22:11:53,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:53,976 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 22, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:53,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 22:11:54,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:54,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash -690688754, now seen corresponding path program 3 times [2024-11-19 22:11:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812130970] [2024-11-19 22:11:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:11:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-19 22:11:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-19 22:11:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 315 proven. 663 refuted. 0 times theorem prover too weak. 2791 trivial. 0 not checked. [2024-11-19 22:11:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812130970] [2024-11-19 22:11:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812130970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372080081] [2024-11-19 22:11:55,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 22:11:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:55,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:55,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 22:11:55,334 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 22:11:55,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:55,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 22:11:55,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 554 proven. 91 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2024-11-19 22:11:55,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 558 proven. 97 refuted. 0 times theorem prover too weak. 3114 trivial. 0 not checked. [2024-11-19 22:11:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372080081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:56,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 13] total 29 [2024-11-19 22:11:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780398923] [2024-11-19 22:11:56,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:56,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 22:11:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 22:11:56,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-19 22:11:56,754 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 18 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (36), 21 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-19 22:11:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:57,290 INFO L93 Difference]: Finished difference Result 304 states and 450 transitions. [2024-11-19 22:11:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 22:11:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 18 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (36), 21 states have call predecessors, (36), 18 states have call successors, (36) Word has length 365 [2024-11-19 22:11:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:57,293 INFO L225 Difference]: With dead ends: 304 [2024-11-19 22:11:57,293 INFO L226 Difference]: Without dead ends: 173 [2024-11-19 22:11:57,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 819 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1815, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 22:11:57,295 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:57,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 481 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:11:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-19 22:11:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2024-11-19 22:11:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.183673469387755) internal successors, (116), 97 states have internal predecessors, (116), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (54), 27 states have call predecessors, (54), 27 states have call successors, (54) [2024-11-19 22:11:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2024-11-19 22:11:57,310 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 365 [2024-11-19 22:11:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:57,311 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2024-11-19 22:11:57,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 18 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (36), 21 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-19 22:11:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2024-11-19 22:11:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-19 22:11:57,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:57,315 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:57,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 22:11:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 22:11:57,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2132859978, now seen corresponding path program 4 times [2024-11-19 22:11:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129564202] [2024-11-19 22:11:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:11:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:11:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-19 22:11:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:11:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 461 proven. 880 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2024-11-19 22:11:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129564202] [2024-11-19 22:11:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129564202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573357119] [2024-11-19 22:11:58,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 22:11:58,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:58,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:58,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 22:11:58,968 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 22:11:58,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:58,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 22:11:58,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2024-11-19 22:11:59,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:12:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 399 proven. 513 refuted. 0 times theorem prover too weak. 4104 trivial. 0 not checked. [2024-11-19 22:12:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573357119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:12:00,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:12:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 15] total 31 [2024-11-19 22:12:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183267524] [2024-11-19 22:12:00,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:12:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 22:12:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:12:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 22:12:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-11-19 22:12:00,725 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand has 31 states, 30 states have (on average 3.1) internal successors, (93), 31 states have internal predecessors, (93), 23 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 21 states have call predecessors, (40), 23 states have call successors, (40) [2024-11-19 22:12:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:12:01,228 INFO L93 Difference]: Finished difference Result 329 states and 491 transitions. [2024-11-19 22:12:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 22:12:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 31 states have internal predecessors, (93), 23 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 21 states have call predecessors, (40), 23 states have call successors, (40) Word has length 419 [2024-11-19 22:12:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:12:01,231 INFO L225 Difference]: With dead ends: 329 [2024-11-19 22:12:01,232 INFO L226 Difference]: Without dead ends: 187 [2024-11-19 22:12:01,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 943 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 22:12:01,234 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:12:01,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 335 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:12:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-19 22:12:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2024-11-19 22:12:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 97 states have internal predecessors, (115), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (54), 26 states have call predecessors, (54), 27 states have call successors, (54) [2024-11-19 22:12:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-19 22:12:01,249 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 419 [2024-11-19 22:12:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:12:01,249 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-19 22:12:01,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 31 states have internal predecessors, (93), 23 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 21 states have call predecessors, (40), 23 states have call successors, (40) [2024-11-19 22:12:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-19 22:12:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-11-19 22:12:01,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:12:01,254 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 50, 50, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 16, 16, 12, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:01,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 22:12:01,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 22:12:01,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:12:01,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:12:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash -206906839, now seen corresponding path program 5 times [2024-11-19 22:12:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:12:01,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901942323] [2024-11-19 22:12:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:12:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:12:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:12:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-19 22:12:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 579 proven. 2330 refuted. 0 times theorem prover too weak. 11684 trivial. 0 not checked. [2024-11-19 22:12:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:12:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901942323] [2024-11-19 22:12:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901942323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:12:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817877834] [2024-11-19 22:12:03,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 22:12:03,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:12:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:12:03,615 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:12:03,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 22:12:03,899 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2024-11-19 22:12:03,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:12:03,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 22:12:03,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:12:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2275 proven. 795 refuted. 0 times theorem prover too weak. 11523 trivial. 0 not checked. [2024-11-19 22:12:04,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:12:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2275 proven. 819 refuted. 0 times theorem prover too weak. 11499 trivial. 0 not checked. [2024-11-19 22:12:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817877834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:12:07,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:12:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 25] total 44 [2024-11-19 22:12:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123207173] [2024-11-19 22:12:07,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:12:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 22:12:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:12:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 22:12:07,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 22:12:07,824 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 44 states have internal predecessors, (128), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) [2024-11-19 22:12:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:12:08,826 INFO L93 Difference]: Finished difference Result 355 states and 621 transitions. [2024-11-19 22:12:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 22:12:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 44 states have internal predecessors, (128), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) Word has length 705 [2024-11-19 22:12:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:12:08,830 INFO L225 Difference]: With dead ends: 355 [2024-11-19 22:12:08,830 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 22:12:08,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1666 GetRequests, 1585 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=723, Invalid=4247, Unknown=0, NotChecked=0, Total=4970 [2024-11-19 22:12:08,833 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:12:08,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 652 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:12:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 22:12:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2024-11-19 22:12:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 126 states have internal predecessors, (144), 35 states have call successors, (35), 28 states have call predecessors, (35), 17 states have return successors, (76), 28 states have call predecessors, (76), 35 states have call successors, (76) [2024-11-19 22:12:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2024-11-19 22:12:08,852 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 705 [2024-11-19 22:12:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:12:08,852 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2024-11-19 22:12:08,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 44 states have internal predecessors, (128), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) [2024-11-19 22:12:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2024-11-19 22:12:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-11-19 22:12:08,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:12:08,858 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 55, 55, 46, 45, 29, 29, 29, 29, 29, 29, 29, 27, 27, 27, 27, 27, 27, 27, 19, 16, 12, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:08,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 22:12:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 22:12:09,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:12:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:12:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1756514052, now seen corresponding path program 6 times [2024-11-19 22:12:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:12:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033290635] [2024-11-19 22:12:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:12:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:12:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:12:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:12:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-19 22:12:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17605 backedges. 1090 proven. 2760 refuted. 0 times theorem prover too weak. 13755 trivial. 0 not checked. [2024-11-19 22:12:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:12:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033290635] [2024-11-19 22:12:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033290635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:12:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825797805] [2024-11-19 22:12:11,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 22:12:11,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:12:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:12:11,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:12:11,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 22:12:11,787 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2024-11-19 22:12:11,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:12:11,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 22:12:11,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:12:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17605 backedges. 2245 proven. 146 refuted. 0 times theorem prover too weak. 15214 trivial. 0 not checked. [2024-11-19 22:12:11,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:12:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17605 backedges. 2245 proven. 152 refuted. 0 times theorem prover too weak. 15208 trivial. 0 not checked. [2024-11-19 22:12:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825797805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:12:14,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:12:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 14, 17] total 44 [2024-11-19 22:12:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332139966] [2024-11-19 22:12:14,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:12:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 22:12:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:12:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 22:12:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 22:12:14,546 INFO L87 Difference]: Start difference. First operand 183 states and 255 transitions. Second operand has 44 states, 43 states have (on average 2.813953488372093) internal successors, (121), 44 states have internal predecessors, (121), 28 states have call successors, (40), 1 states have call predecessors, (40), 17 states have return successors, (54), 36 states have call predecessors, (54), 28 states have call successors, (54) [2024-11-19 22:12:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:12:15,602 INFO L93 Difference]: Finished difference Result 425 states and 676 transitions. [2024-11-19 22:12:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-19 22:12:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.813953488372093) internal successors, (121), 44 states have internal predecessors, (121), 28 states have call successors, (40), 1 states have call predecessors, (40), 17 states have return successors, (54), 36 states have call predecessors, (54), 28 states have call successors, (54) Word has length 773 [2024-11-19 22:12:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:12:15,607 INFO L225 Difference]: With dead ends: 425 [2024-11-19 22:12:15,607 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 22:12:15,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1825 GetRequests, 1749 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=642, Invalid=4188, Unknown=0, NotChecked=0, Total=4830 [2024-11-19 22:12:15,611 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 173 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:12:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 701 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:12:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 22:12:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 220. [2024-11-19 22:12:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 157 states have (on average 1.0828025477707006) internal successors, (170), 151 states have internal predecessors, (170), 44 states have call successors, (44), 36 states have call predecessors, (44), 18 states have return successors, (95), 32 states have call predecessors, (95), 44 states have call successors, (95) [2024-11-19 22:12:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 309 transitions. [2024-11-19 22:12:15,634 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 309 transitions. Word has length 773 [2024-11-19 22:12:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:12:15,635 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 309 transitions. [2024-11-19 22:12:15,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.813953488372093) internal successors, (121), 44 states have internal predecessors, (121), 28 states have call successors, (40), 1 states have call predecessors, (40), 17 states have return successors, (54), 36 states have call predecessors, (54), 28 states have call successors, (54) [2024-11-19 22:12:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 309 transitions. [2024-11-19 22:12:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 22:12:15,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:12:15,638 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:15,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 22:12:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 22:12:15,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:12:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:12:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 7 times [2024-11-19 22:12:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:12:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270804400] [2024-11-19 22:12:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:12:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:12:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:12:15,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:12:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:12:16,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:12:16,005 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:12:16,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:12:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:12:16,011 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:16,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:12:16,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:12:16 BoogieIcfgContainer [2024-11-19 22:12:16,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:12:16,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:12:16,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:12:16,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:12:16,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:34" (3/4) ... [2024-11-19 22:12:16,118 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:12:16,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:12:16,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:12:16,208 INFO L158 Benchmark]: Toolchain (without parser) took 41879.12ms. Allocated memory was 163.6MB in the beginning and 717.2MB in the end (delta: 553.6MB). Free memory was 102.0MB in the beginning and 457.7MB in the end (delta: -355.6MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,208 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:12:16,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.77ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 129.6MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 128.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,209 INFO L158 Benchmark]: Boogie Preprocessor took 21.99ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 126.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,209 INFO L158 Benchmark]: RCFGBuilder took 279.17ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 115.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,209 INFO L158 Benchmark]: TraceAbstraction took 41127.36ms. Allocated memory was 163.6MB in the beginning and 717.2MB in the end (delta: 553.6MB). Free memory was 114.9MB in the beginning and 467.1MB in the end (delta: -352.2MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,209 INFO L158 Benchmark]: Witness Printer took 90.16ms. Allocated memory is still 717.2MB. Free memory was 467.1MB in the beginning and 457.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:12:16,211 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.20ms. Allocated memory is still 100.7MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.77ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 129.6MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 128.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.99ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 126.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 279.17ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 115.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41127.36ms. Allocated memory was 163.6MB in the beginning and 717.2MB in the end (delta: 553.6MB). Free memory was 114.9MB in the beginning and 467.1MB in the end (delta: -352.2MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. * Witness Printer took 90.16ms. Allocated memory is still 717.2MB. Free memory was 467.1MB in the beginning and 457.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.0s, OverallIterations: 16, TraceHistogramMax: 58, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 897 mSDsluCounter, 4784 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4292 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7732 IncrementalHoareTripleChecker+Invalid, 8681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 492 mSDtfsCounter, 7732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8159 GetRequests, 7606 SyntacticMatches, 73 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6698 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=15, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 280 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 7285 NumberOfCodeBlocks, 6579 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 10186 ConstructedInterpolants, 0 QuantifiedInterpolants, 14348 SizeOfPredicates, 54 NumberOfNonLiveVariables, 6159 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 134533/149196 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-11-19 22:12:16,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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