./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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-?-c7c6ca5-m [2024-11-08 15:20:12,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:20:12,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:20:12,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:20:12,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:20:12,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:20:12,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:20:12,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:20:12,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:20:12,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:20:12,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:20:12,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:20:12,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:20:12,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:20:12,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:20:12,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:20:12,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:20:12,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:20:12,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:20:12,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:20:12,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:20:12,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:20:12,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:20:12,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:20:12,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:20:12,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:20:12,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:20:12,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:20:12,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:20:12,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:20:12,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:20:12,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:20:12,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:12,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:20:12,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:20:12,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:20:12,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:20:12,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:20:12,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:20:12,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:20:12,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:20:12,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:20:12,746 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-08 15:20:12,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:20:13,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:20:13,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:20:13,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:20:13,025 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:20:13,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-08 15:20:14,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:20:14,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:20:14,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-08 15:20:14,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea0381bb/32da0bacb352458a954c4e79119929d3/FLAG45e79b635 [2024-11-08 15:20:15,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea0381bb/32da0bacb352458a954c4e79119929d3 [2024-11-08 15:20:15,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:20:15,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:20:15,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:15,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:20:15,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:20:15,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e1a943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15, skipping insertion in model container [2024-11-08 15:20:15,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:20:15,365 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-08 15:20:15,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:15,385 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:20:15,402 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-08 15:20:15,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:15,419 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:20:15,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15 WrapperNode [2024-11-08 15:20:15,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:15,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:15,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:20:15,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:20:15,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,450 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 15:20:15,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:15,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:20:15,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:20:15,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:20:15,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,480 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-08 15:20:15,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:20:15,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:20:15,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:20:15,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:20:15,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (1/1) ... [2024-11-08 15:20:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:15,538 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-08 15:20:15,545 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-08 15:20:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:20:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:20:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-08 15:20:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-08 15:20:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-08 15:20:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-08 15:20:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:20:15,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:20:15,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:20:15,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:20:15,811 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 15:20:15,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:20:15,870 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:20:15,871 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:20:15,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:15 BoogieIcfgContainer [2024-11-08 15:20:15,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:20:15,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:20:15,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:20:15,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:20:15,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:20:15" (1/3) ... [2024-11-08 15:20:15,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df0da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:15, skipping insertion in model container [2024-11-08 15:20:15,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:15" (2/3) ... [2024-11-08 15:20:15,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df0da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:15, skipping insertion in model container [2024-11-08 15:20:15,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:15" (3/3) ... [2024-11-08 15:20:15,881 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2024-11-08 15:20:15,923 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:20:15,923 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:20:15,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:20:15,999 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;@23defa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:20:15,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:20:16,004 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-08 15:20:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:20:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:16,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:16,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2024-11-08 15:20:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246097804] [2024-11-08 15:20:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:20:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246097804] [2024-11-08 15:20:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246097804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758902639] [2024-11-08 15:20:16,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:16,364 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-08 15:20:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:16,415 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-08 15:20:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:16,418 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-08 15:20:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:16,425 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:20:16,426 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:20:16,428 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-08 15:20:16,432 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-08 15:20:16,433 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-08 15:20:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:20:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:20:16,469 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-08 15:20:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:20:16,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-11-08 15:20:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:20:16,476 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-08 15:20:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:20:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 15:20:16,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:16,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:16,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:20:16,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:16,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2024-11-08 15:20:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694222352] [2024-11-08 15:20:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,612 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-08 15:20:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:16,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694222352] [2024-11-08 15:20:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694222352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:16,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756733910] [2024-11-08 15:20:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:16,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:16,620 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-08 15:20:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:16,639 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-08 15:20:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:16,640 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-08 15:20:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:16,641 INFO L225 Difference]: With dead ends: 33 [2024-11-08 15:20:16,642 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 15:20:16,642 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-08 15:20:16,643 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-08 15:20:16,644 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-08 15:20:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 15:20:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-08 15:20:16,655 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-08 15:20:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:20:16,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-11-08 15:20:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:20:16,658 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-08 15:20:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:20:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:20:16,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:16,661 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-08 15:20:16,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:20:16,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2024-11-08 15:20:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489582493] [2024-11-08 15:20:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:20:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,897 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-08 15:20:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489582493] [2024-11-08 15:20:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489582493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834236522] [2024-11-08 15:20:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:16,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:16,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:16,900 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-08 15:20:16,902 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-08 15:20:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:16,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:17,182 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-08 15:20:17,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:17,399 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-08 15:20:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834236522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:17,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-08 15:20:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050177428] [2024-11-08 15:20:17,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:17,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:17,402 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-08 15:20:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:17,563 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-11-08 15:20:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:20:17,564 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-08 15:20:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:17,565 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:20:17,565 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 15:20:17,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:17,567 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-08 15:20:17,567 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-08 15:20:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 15:20:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-08 15:20:17,575 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-08 15:20:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 15:20:17,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-08 15:20:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:17,578 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 15:20:17,578 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-08 15:20:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 15:20:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:20:17,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:17,580 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-08 15:20:17,593 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-08 15:20:17,780 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-08 15:20:17,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:17,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2024-11-08 15:20:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893941497] [2024-11-08 15:20:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,057 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-08 15:20:18,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893941497] [2024-11-08 15:20:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893941497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:18,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712839202] [2024-11-08 15:20:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:18,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:18,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:18,065 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-08 15:20:18,067 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-08 15:20:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:18,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:18,184 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-08 15:20:18,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:18,385 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-08 15:20:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712839202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:18,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-08 15:20:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601887501] [2024-11-08 15:20:18,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:18,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:18,388 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-08 15:20:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:18,574 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2024-11-08 15:20:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:20:18,575 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-08 15:20:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:18,577 INFO L225 Difference]: With dead ends: 53 [2024-11-08 15:20:18,581 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 15:20:18,582 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-08 15:20:18,582 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:18,583 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.2s Time] [2024-11-08 15:20:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 15:20:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-08 15:20:18,594 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-08 15:20:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-08 15:20:18,596 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-11-08 15:20:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:18,596 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-08 15:20:18,597 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-08 15:20:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-08 15:20:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 15:20:18,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:18,598 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-08 15:20:18,615 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-08 15:20:18,799 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-08 15:20:18,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:18,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2024-11-08 15:20:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219939976] [2024-11-08 15:20:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:20:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:20:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:18,950 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-08 15:20:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:18,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219939976] [2024-11-08 15:20:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219939976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130754096] [2024-11-08 15:20:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:18,959 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-08 15:20:18,961 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-08 15:20:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:19,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:19,116 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-08 15:20:19,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:19,482 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-08 15:20:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130754096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:19,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-08 15:20:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963712647] [2024-11-08 15:20:19,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:19,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:20:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:20:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:19,487 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-08 15:20:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:19,755 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2024-11-08 15:20:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:20:19,756 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-08 15:20:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:19,759 INFO L225 Difference]: With dead ends: 109 [2024-11-08 15:20:19,759 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 15:20:19,764 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-08 15:20:19,765 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:19,765 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.2s Time] [2024-11-08 15:20:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 15:20:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-08 15:20:19,780 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-08 15:20:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-08 15:20:19,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2024-11-08 15:20:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:19,782 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-08 15:20:19,783 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-08 15:20:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-08 15:20:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:20:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:19,785 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-08 15:20:19,798 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-08 15:20:19,987 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-08 15:20:19,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:19,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2024-11-08 15:20:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103505979] [2024-11-08 15:20:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,136 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-08 15:20:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103505979] [2024-11-08 15:20:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103505979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282702644] [2024-11-08 15:20:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:20,140 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-08 15:20:20,144 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-08 15:20:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:20,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:20,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:20,287 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-08 15:20:20,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:20,628 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-08 15:20:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282702644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:20,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:20,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-08 15:20:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641133262] [2024-11-08 15:20:20,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:20,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:20:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:20:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:20:20,631 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-08 15:20:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:20,955 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2024-11-08 15:20:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:20:20,956 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-08 15:20:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:20,959 INFO L225 Difference]: With dead ends: 179 [2024-11-08 15:20:20,959 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 15:20:20,961 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-08 15:20:20,962 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-08 15:20:20,962 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-08 15:20:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 15:20:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-08 15:20:20,995 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-08 15:20:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2024-11-08 15:20:20,997 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 37 [2024-11-08 15:20:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2024-11-08 15:20:20,998 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-08 15:20:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2024-11-08 15:20:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:20:21,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:21,001 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-08 15:20:21,019 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-08 15:20:21,205 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-08 15:20:21,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:21,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2024-11-08 15:20:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968686972] [2024-11-08 15:20:21,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:20:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,403 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-08 15:20:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968686972] [2024-11-08 15:20:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968686972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227800780] [2024-11-08 15:20:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:21,406 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-08 15:20:21,407 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-08 15:20:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:21,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:21,557 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-08 15:20:21,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:22,069 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-08 15:20:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227800780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:22,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-11-08 15:20:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953351640] [2024-11-08 15:20:22,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:22,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:20:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:20:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:20:22,075 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-08 15:20:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:22,430 INFO L93 Difference]: Finished difference Result 249 states and 486 transitions. [2024-11-08 15:20:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:20:22,431 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-08 15:20:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:22,434 INFO L225 Difference]: With dead ends: 249 [2024-11-08 15:20:22,434 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 15:20:22,435 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-08 15:20:22,436 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:22,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 223 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 15:20:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2024-11-08 15:20:22,473 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-08 15:20:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2024-11-08 15:20:22,477 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2024-11-08 15:20:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:22,480 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2024-11-08 15:20:22,480 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-08 15:20:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2024-11-08 15:20:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 15:20:22,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:22,485 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-08 15:20:22,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:22,685 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-08 15:20:22,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:22,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1851863125, now seen corresponding path program 1 times [2024-11-08 15:20:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110348584] [2024-11-08 15:20:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:20:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:23,011 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-08 15:20:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110348584] [2024-11-08 15:20:23,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110348584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454111911] [2024-11-08 15:20:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:23,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:23,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:23,013 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-08 15:20:23,015 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-08 15:20:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:23,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:20:23,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:23,209 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-08 15:20:23,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:24,009 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-08 15:20:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454111911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:24,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2024-11-08 15:20:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500381859] [2024-11-08 15:20:24,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:24,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:20:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:20:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:20:24,012 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-08 15:20:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:24,474 INFO L93 Difference]: Finished difference Result 253 states and 491 transitions. [2024-11-08 15:20:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 15:20:24,475 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-08 15:20:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:24,477 INFO L225 Difference]: With dead ends: 253 [2024-11-08 15:20:24,477 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 15:20:24,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 15:20:24,479 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:24,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 291 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:20:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 15:20:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-08 15:20:24,497 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-08 15:20:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-08 15:20:24,498 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 79 [2024-11-08 15:20:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:24,498 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-08 15:20:24,498 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-08 15:20:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-08 15:20:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 15:20:24,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:24,504 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-08 15:20:24,521 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-08 15:20:24,705 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-08 15:20:24,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2024-11-08 15:20:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24983481] [2024-11-08 15:20:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:20:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 15:20:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,218 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-08 15:20:25,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24983481] [2024-11-08 15:20:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24983481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288710554] [2024-11-08 15:20:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:25,220 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-08 15:20:25,221 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-08 15:20:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:20:25,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:25,448 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-08 15:20:25,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:26,664 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-08 15:20:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288710554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:26,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2024-11-08 15:20:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067762386] [2024-11-08 15:20:26,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 15:20:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 15:20:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:20:26,668 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-08 15:20:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:27,163 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2024-11-08 15:20:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 15:20:27,164 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-08 15:20:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:27,166 INFO L225 Difference]: With dead ends: 226 [2024-11-08 15:20:27,166 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 15:20:27,168 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-08 15:20:27,168 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:27,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 360 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:20:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 15:20:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2024-11-08 15:20:27,192 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-08 15:20:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-11-08 15:20:27,195 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 148 [2024-11-08 15:20:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:27,197 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-11-08 15:20:27,197 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-08 15:20:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-11-08 15:20:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-08 15:20:27,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:27,203 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-08 15:20:27,221 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-08 15:20:27,407 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-08 15:20:27,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -502163779, now seen corresponding path program 1 times [2024-11-08 15:20:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742783503] [2024-11-08 15:20:27,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:20:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 15:20:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:20:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,813 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-08 15:20:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:28,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742783503] [2024-11-08 15:20:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742783503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201966453] [2024-11-08 15:20:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:28,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:28,816 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-08 15:20:28,818 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-08 15:20:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:28,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:20:28,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:29,145 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-08 15:20:29,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:31,196 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-08 15:20:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201966453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:31,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 32 [2024-11-08 15:20:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675693952] [2024-11-08 15:20:31,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:31,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 15:20:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 15:20:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:20:31,200 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-08 15:20:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:31,897 INFO L93 Difference]: Finished difference Result 267 states and 464 transitions. [2024-11-08 15:20:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 15:20:31,898 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-08 15:20:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:31,900 INFO L225 Difference]: With dead ends: 267 [2024-11-08 15:20:31,900 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 15:20:31,903 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-08 15:20:31,903 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:31,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 495 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:20:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 15:20:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-08 15:20:31,926 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-08 15:20:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-08 15:20:31,928 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 323 [2024-11-08 15:20:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:31,928 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-08 15:20:31,928 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-08 15:20:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-08 15:20:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-08 15:20:31,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:31,937 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-08 15:20:31,958 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-08 15:20:32,140 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-08 15:20:32,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:32,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2144563242, now seen corresponding path program 2 times [2024-11-08 15:20:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845395951] [2024-11-08 15:20:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:20:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 15:20:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-08 15:20:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:33,228 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-08 15:20:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:33,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845395951] [2024-11-08 15:20:33,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845395951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:33,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298008389] [2024-11-08 15:20:33,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:33,230 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-08 15:20:33,232 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-08 15:20:33,471 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:33,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:33,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:20:33,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:33,649 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-08 15:20:33,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:35,476 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-08 15:20:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298008389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:35,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 25 [2024-11-08 15:20:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689000927] [2024-11-08 15:20:35,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:20:35,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:20:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:20:35,479 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-08 15:20:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:35,949 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-08 15:20:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 15:20:35,950 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-08 15:20:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:35,952 INFO L225 Difference]: With dead ends: 244 [2024-11-08 15:20:35,952 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 15:20:35,955 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-08 15:20:35,956 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:35,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 295 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:20:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 15:20:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-08 15:20:35,972 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-08 15:20:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2024-11-08 15:20:35,973 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 419 [2024-11-08 15:20:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:35,974 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2024-11-08 15:20:35,974 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-08 15:20:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2024-11-08 15:20:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-08 15:20:35,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:35,977 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-08 15:20:35,997 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-08 15:20:36,178 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-08 15:20:36,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -690688754, now seen corresponding path program 3 times [2024-11-08 15:20:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336336345] [2024-11-08 15:20:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 15:20:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-08 15:20:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:37,190 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-08 15:20:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336336345] [2024-11-08 15:20:37,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336336345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554025203] [2024-11-08 15:20:37,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:37,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:37,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:37,193 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-08 15:20:37,194 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-08 15:20:37,335 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-08 15:20:37,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:37,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:20:37,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:37,469 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-08 15:20:37,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:38,877 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-08 15:20:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554025203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:38,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 13] total 29 [2024-11-08 15:20:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525853373] [2024-11-08 15:20:38,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:38,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 15:20:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 15:20:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-08 15:20:38,882 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-08 15:20:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:39,594 INFO L93 Difference]: Finished difference Result 304 states and 450 transitions. [2024-11-08 15:20:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 15:20:39,594 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-08 15:20:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:39,597 INFO L225 Difference]: With dead ends: 304 [2024-11-08 15:20:39,597 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 15:20:39,598 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-08 15:20:39,599 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:39,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 481 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:20:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 15:20:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2024-11-08 15:20:39,612 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-08 15:20:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2024-11-08 15:20:39,614 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 365 [2024-11-08 15:20:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2024-11-08 15:20:39,615 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-08 15:20:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2024-11-08 15:20:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-08 15:20:39,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:39,618 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-08 15:20:39,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 15:20:39,822 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-08 15:20:39,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2132859978, now seen corresponding path program 4 times [2024-11-08 15:20:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290285397] [2024-11-08 15:20:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-08 15:20:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,109 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-08 15:20:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290285397] [2024-11-08 15:20:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290285397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753504236] [2024-11-08 15:20:41,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:20:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:41,112 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-08 15:20:41,113 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-08 15:20:41,316 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:20:41,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:41,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:20:41,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:41,421 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-08 15:20:41,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:42,983 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-08 15:20:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753504236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:42,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 15] total 31 [2024-11-08 15:20:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544860740] [2024-11-08 15:20:42,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:42,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 15:20:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 15:20:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-11-08 15:20:42,986 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-08 15:20:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:43,574 INFO L93 Difference]: Finished difference Result 329 states and 491 transitions. [2024-11-08 15:20:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 15:20:43,574 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-08 15:20:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:43,577 INFO L225 Difference]: With dead ends: 329 [2024-11-08 15:20:43,577 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 15:20:43,579 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-08 15:20:43,581 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:43,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 335 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:20:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 15:20:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2024-11-08 15:20:43,594 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-08 15:20:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-08 15:20:43,595 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 419 [2024-11-08 15:20:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:43,596 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-08 15:20:43,596 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-08 15:20:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-08 15:20:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-11-08 15:20:43,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:43,600 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-08 15:20:43,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 15:20:43,801 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-08 15:20:43,801 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -206906839, now seen corresponding path program 5 times [2024-11-08 15:20:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394931763] [2024-11-08 15:20:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-08 15:20:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,880 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-08 15:20:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:45,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394931763] [2024-11-08 15:20:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394931763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:45,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554814621] [2024-11-08 15:20:45,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:20:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:45,886 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-08 15:20:45,888 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-08 15:20:46,179 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2024-11-08 15:20:46,180 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:46,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 15:20:46,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:46,371 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-08 15:20:46,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:49,999 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-08 15:20:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554814621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:49,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 25] total 44 [2024-11-08 15:20:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905688359] [2024-11-08 15:20:50,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:50,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-08 15:20:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:50,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-08 15:20:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:20:50,003 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-08 15:20:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:51,011 INFO L93 Difference]: Finished difference Result 355 states and 621 transitions. [2024-11-08 15:20:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 15:20:51,012 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-08 15:20:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:51,017 INFO L225 Difference]: With dead ends: 355 [2024-11-08 15:20:51,018 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 15:20:51,020 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-08 15:20:51,021 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:51,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 652 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 15:20:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 15:20:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2024-11-08 15:20:51,038 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-08 15:20:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2024-11-08 15:20:51,040 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 705 [2024-11-08 15:20:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:51,040 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2024-11-08 15:20:51,041 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-08 15:20:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2024-11-08 15:20:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-11-08 15:20:51,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:51,046 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-08 15:20:51,060 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-08 15:20:51,246 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-08 15:20:51,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1756514052, now seen corresponding path program 6 times [2024-11-08 15:20:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811061345] [2024-11-08 15:20:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-08 15:20:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-08 15:20:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:20:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,596 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-08 15:20:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811061345] [2024-11-08 15:20:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811061345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049391799] [2024-11-08 15:20:53,597 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:20:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:53,599 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-08 15:20:53,601 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-08 15:20:53,913 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2024-11-08 15:20:53,913 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:53,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:20:53,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:54,088 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-08 15:20:54,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:56,893 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-08 15:20:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049391799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:56,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 14, 17] total 44 [2024-11-08 15:20:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43113160] [2024-11-08 15:20:56,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-08 15:20:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-08 15:20:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:20:56,898 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-08 15:20:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:57,970 INFO L93 Difference]: Finished difference Result 425 states and 676 transitions. [2024-11-08 15:20:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-08 15:20:57,970 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-08 15:20:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:57,974 INFO L225 Difference]: With dead ends: 425 [2024-11-08 15:20:57,974 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 15:20:57,977 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-08 15:20:57,979 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 173 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:57,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 701 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:20:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 15:20:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 220. [2024-11-08 15:20:57,996 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-08 15:20:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 309 transitions. [2024-11-08 15:20:57,998 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 309 transitions. Word has length 773 [2024-11-08 15:20:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:57,999 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 309 transitions. [2024-11-08 15:20:57,999 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-08 15:20:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 309 transitions. [2024-11-08 15:20:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-08 15:20:58,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:58,002 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-08 15:20:58,022 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-08 15:20:58,203 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-08 15:20:58,203 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 7 times [2024-11-08 15:20:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550925290] [2024-11-08 15:20:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:58,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:20:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:58,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:20:58,335 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:20:58,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:20:58,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:20:58,343 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:58,445 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:20:58,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:20:58 BoogieIcfgContainer [2024-11-08 15:20:58,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:20:58,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:20:58,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:20:58,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:20:58,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:15" (3/4) ... [2024-11-08 15:20:58,452 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:20:58,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:20:58,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:20:58,563 INFO L158 Benchmark]: Toolchain (without parser) took 43415.62ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 85.4MB in the beginning and 380.4MB in the end (delta: -295.0MB). Peak memory consumption was 334.3MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,563 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:58,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 73.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.85ms. Allocated memory is still 159.4MB. Free memory was 73.0MB in the beginning and 71.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,564 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:58,564 INFO L158 Benchmark]: RCFGBuilder took 370.61ms. Allocated memory is still 159.4MB. Free memory was 69.9MB in the beginning and 127.0MB in the end (delta: -57.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,564 INFO L158 Benchmark]: TraceAbstraction took 42576.20ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 126.3MB in the beginning and 389.9MB in the end (delta: -263.6MB). Peak memory consumption was 362.7MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,565 INFO L158 Benchmark]: Witness Printer took 112.36ms. Allocated memory is still 786.4MB. Free memory was 389.9MB in the beginning and 380.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:20:58,566 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.21ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 73.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.85ms. Allocated memory is still 159.4MB. Free memory was 73.0MB in the beginning and 71.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 370.61ms. Allocated memory is still 159.4MB. Free memory was 69.9MB in the beginning and 127.0MB in the end (delta: -57.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42576.20ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 126.3MB in the beginning and 389.9MB in the end (delta: -263.6MB). Peak memory consumption was 362.7MB. Max. memory is 16.1GB. * Witness Printer took 112.36ms. Allocated memory is still 786.4MB. Free memory was 389.9MB in the beginning and 380.4MB in the end (delta: 9.5MB). 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: 42.4s, OverallIterations: 16, TraceHistogramMax: 58, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 897 mSDsluCounter, 4784 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4292 mSDsCounter, 967 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7672 IncrementalHoareTripleChecker+Invalid, 8639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 967 mSolverCounterUnsat, 492 mSDtfsCounter, 7672 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.4s 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, 29.6s 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-08 15:20:58,602 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