./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_6-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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:21:58,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:21:58,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:21:58,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:21:58,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:21:58,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:21:58,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:21:58,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:21:58,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:21:58,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:21:58,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:21:58,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:21:58,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:21:58,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:21:58,752 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:21:58,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:21:58,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:21:58,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:21:58,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:21:58,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:21:58,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:21:58,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:21:58,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:21:58,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:21:58,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:21:58,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:21:58,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:21:58,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:21:58,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:21:58,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:21:58,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:21:58,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:21:58,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:21:58,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:21:58,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:21:58,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:21:58,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:21:58,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:21:58,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:21:58,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:21:58,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:21:58,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:21:58,767 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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2024-11-09 23:21:59,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:21:59,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:21:59,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:21:59,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:21:59,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:21:59,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-11-09 23:22:00,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:22:00,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:22:00,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-11-09 23:22:00,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bbed274a/14b1ad7adf13424d85a20b00531ea30a/FLAG30e938c96 [2024-11-09 23:22:00,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bbed274a/14b1ad7adf13424d85a20b00531ea30a [2024-11-09 23:22:00,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:22:00,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:22:00,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:00,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:22:00,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:22:00,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:00" (1/1) ... [2024-11-09 23:22:00,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340098ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:00, skipping insertion in model container [2024-11-09 23:22:00,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:00" (1/1) ... [2024-11-09 23:22:00,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:22:00,957 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_6-2.c[946,959] [2024-11-09 23:22:00,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:00,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:22:00,992 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_6-2.c[946,959] [2024-11-09 23:22:00,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:01,009 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:22:01,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01 WrapperNode [2024-11-09 23:22:01,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:01,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:01,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:22:01,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:22:01,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,040 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-09 23:22:01,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:01,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:22:01,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:22:01,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:22:01,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,066 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-09 23:22:01,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:22:01,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:22:01,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:22:01,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:22:01,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (1/1) ... [2024-11-09 23:22:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:22:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:01,116 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-09 23:22:01,118 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-09 23:22:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:22:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:22:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-09 23:22:01,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-09 23:22:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-09 23:22:01,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-09 23:22:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:22:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:22:01,231 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:22:01,234 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:22:01,351 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2024-11-09 23:22:01,378 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2024-11-09 23:22:01,394 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 23:22:01,394 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:22:01,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:22:01,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:22:01,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:01 BoogieIcfgContainer [2024-11-09 23:22:01,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:22:01,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:22:01,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:22:01,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:22:01,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:22:00" (1/3) ... [2024-11-09 23:22:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347b0152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:01, skipping insertion in model container [2024-11-09 23:22:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:01" (2/3) ... [2024-11-09 23:22:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347b0152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:01, skipping insertion in model container [2024-11-09 23:22:01,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:01" (3/3) ... [2024-11-09 23:22:01,420 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2024-11-09 23:22:01,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:22:01,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:22:01,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:22:01,516 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;@6e010445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:22:01,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:22:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-09 23:22:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:22:01,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:01,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:01,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1889766502, now seen corresponding path program 1 times [2024-11-09 23:22:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550987911] [2024-11-09 23:22:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:01,853 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-09 23:22:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550987911] [2024-11-09 23:22:01,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550987911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:22:01,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:22:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:22:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383895301] [2024-11-09 23:22:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:22:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:22:01,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:22:01,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:01,881 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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.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-09 23:22:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:01,939 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-09 23:22:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:22:01,944 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-09 23:22:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:01,954 INFO L225 Difference]: With dead ends: 42 [2024-11-09 23:22:01,954 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 23:22:01,957 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-09 23:22:01,961 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 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-09 23:22:01,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 23:22:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 23:22:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-09 23:22:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 23:22:02,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-09 23:22:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:02,007 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 23:22:02,008 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-09 23:22:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 23:22:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 23:22:02,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:02,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:22:02,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1119543594, now seen corresponding path program 1 times [2024-11-09 23:22:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922455730] [2024-11-09 23:22:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,155 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-09 23:22:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922455730] [2024-11-09 23:22:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922455730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:22:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:22:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:22:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864619855] [2024-11-09 23:22:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:22:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:22:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:22:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:02,161 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09 23:22:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:02,211 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-09 23:22:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:22:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-09 23:22:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:02,214 INFO L225 Difference]: With dead ends: 35 [2024-11-09 23:22:02,214 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 23:22:02,216 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-09 23:22:02,220 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 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-09 23:22:02,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 23:22:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-09 23:22:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-09 23:22:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 23:22:02,235 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 12 [2024-11-09 23:22:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:02,236 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 23:22:02,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09 23:22:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 23:22:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 23:22:02,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:02,238 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, 1] [2024-11-09 23:22:02,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:22:02,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2127390698, now seen corresponding path program 1 times [2024-11-09 23:22:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083213475] [2024-11-09 23:22:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:22:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,402 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-09 23:22:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083213475] [2024-11-09 23:22:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083213475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033488477] [2024-11-09 23:22:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:02,410 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-09 23:22:02,411 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-09 23:22:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:02,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:22:02,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:02,573 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-09 23:22:02,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:02,803 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-09 23:22:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033488477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:02,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-09 23:22:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751196130] [2024-11-09 23:22:02,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:02,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:22:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:02,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:22:02,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:22:02,807 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 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-09 23:22:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:02,970 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-09 23:22:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:22:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 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 24 [2024-11-09 23:22:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:02,972 INFO L225 Difference]: With dead ends: 57 [2024-11-09 23:22:02,973 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 23:22:02,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:22:02,976 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:02,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 136 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 23:22:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 23:22:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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-09 23:22:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 23:22:02,991 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-09 23:22:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:02,992 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 23:22:02,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 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-09 23:22:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 23:22:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:22:02,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:02,995 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, 1] [2024-11-09 23:22:03,015 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-09 23:22:03,200 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-09 23:22:03,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2059978289, now seen corresponding path program 1 times [2024-11-09 23:22:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136350892] [2024-11-09 23:22:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:22:03,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136350892] [2024-11-09 23:22:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136350892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965098727] [2024-11-09 23:22:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:03,377 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-09 23:22:03,380 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-09 23:22:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:03,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:22:03,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:03,487 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-09 23:22:03,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:03,702 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-09 23:22:03,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965098727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:03,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:03,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-09 23:22:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452493916] [2024-11-09 23:22:03,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:03,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:22:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:03,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:22:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:22:03,707 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 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-09 23:22:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:03,873 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2024-11-09 23:22:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:22:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 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 25 [2024-11-09 23:22:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:03,876 INFO L225 Difference]: With dead ends: 55 [2024-11-09 23:22:03,878 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 23:22:03,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 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-09 23:22:03,879 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:03,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 121 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 23:22:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-09 23:22:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 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-09 23:22:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-11-09 23:22:03,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 25 [2024-11-09 23:22:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:03,891 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-11-09 23:22:03,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 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-09 23:22:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-11-09 23:22:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:22:03,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:03,893 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-09 23:22:03,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:22:04,094 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-09 23:22:04,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:04,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash -747014037, now seen corresponding path program 1 times [2024-11-09 23:22:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55568268] [2024-11-09 23:22:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:22:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 23:22:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,233 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-09 23:22:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55568268] [2024-11-09 23:22:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55568268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350754213] [2024-11-09 23:22:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:04,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:04,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:04,238 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-09 23:22:04,240 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-09 23:22:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:04,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:22:04,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:04,379 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-09 23:22:04,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:04,730 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-09 23:22:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350754213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:04,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-09 23:22:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913361664] [2024-11-09 23:22:04,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:22:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:22:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:22:04,734 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 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-09 23:22:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:04,971 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2024-11-09 23:22:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:22:04,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 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 37 [2024-11-09 23:22:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:04,974 INFO L225 Difference]: With dead ends: 111 [2024-11-09 23:22:04,974 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 23:22:04,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 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-09 23:22:04,976 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:04,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 23:22:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-09 23:22:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 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-09 23:22:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-09 23:22:04,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 37 [2024-11-09 23:22:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:04,989 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-09 23:22:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 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-09 23:22:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-09 23:22:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:22:04,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:04,992 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, 1] [2024-11-09 23:22:05,009 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-09 23:22:05,195 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-09 23:22:05,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 335870733, now seen corresponding path program 1 times [2024-11-09 23:22:05,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:05,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636781043] [2024-11-09 23:22:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,346 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-09 23:22:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636781043] [2024-11-09 23:22:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636781043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544327911] [2024-11-09 23:22:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:05,352 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-09 23:22:05,354 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-09 23:22:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:05,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:22:05,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:05,493 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-09 23:22:05,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:05,802 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-09 23:22:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544327911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:05,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-09 23:22:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401633796] [2024-11-09 23:22:05,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:05,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:22:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:22:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:22:05,805 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 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-09 23:22:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:06,123 INFO L93 Difference]: Finished difference Result 181 states and 327 transitions. [2024-11-09 23:22:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:22:06,124 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 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 38 [2024-11-09 23:22:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:06,127 INFO L225 Difference]: With dead ends: 181 [2024-11-09 23:22:06,127 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 23:22:06,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 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-09 23:22:06,129 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:06,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 283 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 23:22:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-11-09 23:22:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 68 states have internal predecessors, (79), 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-09 23:22:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2024-11-09 23:22:06,163 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 38 [2024-11-09 23:22:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2024-11-09 23:22:06,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 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-09 23:22:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2024-11-09 23:22:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:22:06,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:06,169 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, 1] [2024-11-09 23:22:06,189 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-09 23:22:06,370 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-09 23:22:06,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -37020151, now seen corresponding path program 1 times [2024-11-09 23:22:06,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:06,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049475934] [2024-11-09 23:22:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:22:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,605 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-09 23:22:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049475934] [2024-11-09 23:22:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049475934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78058629] [2024-11-09 23:22:06,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:06,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:06,608 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-09 23:22:06,609 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-09 23:22:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:06,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:22:06,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:06,767 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-09 23:22:06,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:07,293 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-09 23:22:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78058629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:07,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:07,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-11-09 23:22:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454739469] [2024-11-09 23:22:07,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:07,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 23:22:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 23:22:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:22:07,298 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 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-09 23:22:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:07,682 INFO L93 Difference]: Finished difference Result 251 states and 488 transitions. [2024-11-09 23:22:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:22:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 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 52 [2024-11-09 23:22:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:07,687 INFO L225 Difference]: With dead ends: 251 [2024-11-09 23:22:07,687 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 23:22:07,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 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-09 23:22:07,689 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:07,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 299 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:22:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 23:22:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2024-11-09 23:22:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 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-09 23:22:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 178 transitions. [2024-11-09 23:22:07,726 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 178 transitions. Word has length 52 [2024-11-09 23:22:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 178 transitions. [2024-11-09 23:22:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 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-09 23:22:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 178 transitions. [2024-11-09 23:22:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:22:07,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:07,732 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, 1] [2024-11-09 23:22:07,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:22:07,936 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-09 23:22:07,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -717502930, now seen corresponding path program 1 times [2024-11-09 23:22:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517599617] [2024-11-09 23:22:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 23:22:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,178 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-09 23:22:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517599617] [2024-11-09 23:22:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517599617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441858897] [2024-11-09 23:22:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:08,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:08,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:08,180 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-09 23:22:08,181 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-09 23:22:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:08,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:22:08,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:08,383 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-09 23:22:08,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:09,172 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-09 23:22:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441858897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:09,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:09,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2024-11-09 23:22:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885299084] [2024-11-09 23:22:09,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:09,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:22:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:22:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:22:09,175 INFO L87 Difference]: Start difference. First operand 110 states and 178 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 23:22:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:09,643 INFO L93 Difference]: Finished difference Result 255 states and 493 transitions. [2024-11-09 23:22:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 23:22:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) Word has length 80 [2024-11-09 23:22:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:09,645 INFO L225 Difference]: With dead ends: 255 [2024-11-09 23:22:09,646 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 23:22:09,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:22:09,649 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:09,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:22:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 23:22:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2024-11-09 23:22:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 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-09 23:22:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-09 23:22:09,671 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 80 [2024-11-09 23:22:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:09,672 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-09 23:22:09,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 23:22:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-09 23:22:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:22:09,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:09,674 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:09,691 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-09 23:22:09,878 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-09 23:22:09,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -52905147, now seen corresponding path program 1 times [2024-11-09 23:22:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469689181] [2024-11-09 23:22:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 23:22:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:22:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-09 23:22:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469689181] [2024-11-09 23:22:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469689181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135278291] [2024-11-09 23:22:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:10,284 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-09 23:22:10,285 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-09 23:22:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:10,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:22:10,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-09 23:22:10,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 94 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-09 23:22:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135278291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:11,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2024-11-09 23:22:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823581969] [2024-11-09 23:22:11,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:22:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:22:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:22:11,032 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-09 23:22:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:11,336 INFO L93 Difference]: Finished difference Result 181 states and 268 transitions. [2024-11-09 23:22:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 23:22:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 121 [2024-11-09 23:22:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:11,338 INFO L225 Difference]: With dead ends: 181 [2024-11-09 23:22:11,338 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 23:22:11,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 263 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:22:11,339 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:11,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 307 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 23:22:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2024-11-09 23:22:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 65 states have internal predecessors, (74), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2024-11-09 23:22:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-09 23:22:11,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 121 [2024-11-09 23:22:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:11,350 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-09 23:22:11,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-09 23:22:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-09 23:22:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 23:22:11,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:11,352 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:11,369 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-09 23:22:11,556 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-09 23:22:11,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:11,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -325968461, now seen corresponding path program 1 times [2024-11-09 23:22:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694788376] [2024-11-09 23:22:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:22:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:22:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 112 proven. 278 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-09 23:22:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694788376] [2024-11-09 23:22:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694788376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660930600] [2024-11-09 23:22:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:12,128 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-09 23:22:12,130 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-09 23:22:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:12,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:22:12,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 104 proven. 204 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2024-11-09 23:22:12,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 108 proven. 208 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-11-09 23:22:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660930600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:13,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 13] total 26 [2024-11-09 23:22:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194375126] [2024-11-09 23:22:13,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:13,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 23:22:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 23:22:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:22:13,332 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 26 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 19 states have call successors, (29), 1 states have call predecessors, (29), 11 states have return successors, (36), 18 states have call predecessors, (36), 19 states have call successors, (36) [2024-11-09 23:22:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:13,843 INFO L93 Difference]: Finished difference Result 217 states and 368 transitions. [2024-11-09 23:22:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 23:22:13,843 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 19 states have call successors, (29), 1 states have call predecessors, (29), 11 states have return successors, (36), 18 states have call predecessors, (36), 19 states have call successors, (36) Word has length 189 [2024-11-09 23:22:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:13,845 INFO L225 Difference]: With dead ends: 217 [2024-11-09 23:22:13,845 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 23:22:13,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 417 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:22:13,847 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 70 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:13,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 386 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:22:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 23:22:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2024-11-09 23:22:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (29), 18 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-09 23:22:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-11-09 23:22:13,864 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 189 [2024-11-09 23:22:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-11-09 23:22:13,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 19 states have call successors, (29), 1 states have call predecessors, (29), 11 states have return successors, (36), 18 states have call predecessors, (36), 19 states have call successors, (36) [2024-11-09 23:22:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2024-11-09 23:22:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 23:22:13,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:13,866 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:13,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 23:22:14,068 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-09 23:22:14,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 756639874, now seen corresponding path program 2 times [2024-11-09 23:22:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851357778] [2024-11-09 23:22:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:22:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 165 proven. 92 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-09 23:22:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851357778] [2024-11-09 23:22:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851357778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761695529] [2024-11-09 23:22:14,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:22:14,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:14,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:14,565 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-09 23:22:14,570 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-09 23:22:14,665 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:22:14,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:14,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:22:14,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-09 23:22:14,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 143 proven. 37 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 23:22:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761695529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:15,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 11] total 24 [2024-11-09 23:22:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814974200] [2024-11-09 23:22:15,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:15,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:22:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:22:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:22:15,298 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 16 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-09 23:22:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:15,628 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2024-11-09 23:22:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 23:22:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 16 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) Word has length 148 [2024-11-09 23:22:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:15,630 INFO L225 Difference]: With dead ends: 185 [2024-11-09 23:22:15,630 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 23:22:15,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 325 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:22:15,632 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:15,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 343 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 23:22:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2024-11-09 23:22:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2024-11-09 23:22:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2024-11-09 23:22:15,648 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 148 [2024-11-09 23:22:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:15,648 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2024-11-09 23:22:15,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 16 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-09 23:22:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2024-11-09 23:22:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-09 23:22:15,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:15,654 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:15,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 23:22:15,855 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-09 23:22:15,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:15,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash 354966650, now seen corresponding path program 3 times [2024-11-09 23:22:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:15,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382983895] [2024-11-09 23:22:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 23:22:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 160 proven. 546 refuted. 0 times theorem prover too weak. 1297 trivial. 0 not checked. [2024-11-09 23:22:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382983895] [2024-11-09 23:22:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382983895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053127452] [2024-11-09 23:22:16,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:22:16,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:16,661 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-09 23:22:16,662 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-09 23:22:16,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 23:22:16,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:16,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:22:16,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 383 proven. 75 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2024-11-09 23:22:16,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 383 proven. 85 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2024-11-09 23:22:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053127452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:17,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 13] total 32 [2024-11-09 23:22:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720098235] [2024-11-09 23:22:17,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 23:22:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 23:22:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:22:17,870 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand has 32 states, 30 states have (on average 3.066666666666667) internal successors, (92), 32 states have internal predecessors, (92), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (37), 23 states have call predecessors, (37), 20 states have call successors, (37) [2024-11-09 23:22:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:18,362 INFO L93 Difference]: Finished difference Result 225 states and 315 transitions. [2024-11-09 23:22:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 23:22:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.066666666666667) internal successors, (92), 32 states have internal predecessors, (92), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (37), 23 states have call predecessors, (37), 20 states have call successors, (37) Word has length 270 [2024-11-09 23:22:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:18,364 INFO L225 Difference]: With dead ends: 225 [2024-11-09 23:22:18,364 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 23:22:18,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 601 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 23:22:18,367 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:18,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 437 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:22:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 23:22:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2024-11-09 23:22:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 77 states have internal predecessors, (89), 19 states have call successors, (19), 14 states have call predecessors, (19), 14 states have return successors, (33), 21 states have call predecessors, (33), 19 states have call successors, (33) [2024-11-09 23:22:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2024-11-09 23:22:18,380 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 270 [2024-11-09 23:22:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2024-11-09 23:22:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.066666666666667) internal successors, (92), 32 states have internal predecessors, (92), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (37), 23 states have call predecessors, (37), 20 states have call successors, (37) [2024-11-09 23:22:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2024-11-09 23:22:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 23:22:18,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:18,384 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:18,402 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-09 23:22:18,587 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-09 23:22:18,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1454438460, now seen corresponding path program 4 times [2024-11-09 23:22:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356128742] [2024-11-09 23:22:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:22:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 23:22:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 155 proven. 209 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-11-09 23:22:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356128742] [2024-11-09 23:22:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356128742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977621142] [2024-11-09 23:22:19,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:22:19,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:19,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:19,071 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-09 23:22:19,072 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-09 23:22:19,179 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:22:19,179 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:19,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 23:22:19,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 101 proven. 320 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-09 23:22:19,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 101 proven. 341 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2024-11-09 23:22:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977621142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:21,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2024-11-09 23:22:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333329280] [2024-11-09 23:22:21,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:22:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:22:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:22:21,076 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-09 23:22:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:21,344 INFO L93 Difference]: Finished difference Result 214 states and 270 transitions. [2024-11-09 23:22:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:22:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 202 [2024-11-09 23:22:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:21,346 INFO L225 Difference]: With dead ends: 214 [2024-11-09 23:22:21,346 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 23:22:21,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:22:21,348 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:21,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 383 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 23:22:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 23:22:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 71 states have internal predecessors, (81), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 23:22:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-09 23:22:21,356 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 202 [2024-11-09 23:22:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:21,356 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-09 23:22:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-09 23:22:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-09 23:22:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 23:22:21,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:21,359 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:21,376 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-09 23:22:21,562 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-09 23:22:21,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 937358526, now seen corresponding path program 5 times [2024-11-09 23:22:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107385319] [2024-11-09 23:22:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:22:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 193 proven. 340 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-09 23:22:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107385319] [2024-11-09 23:22:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107385319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737815540] [2024-11-09 23:22:22,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:22:22,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:22,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:22,260 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-09 23:22:22,262 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-09 23:22:22,397 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-09 23:22:22,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:22,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:22:22,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 225 proven. 326 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-11-09 23:22:22,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 227 proven. 333 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-09 23:22:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737815540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:23,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 19] total 36 [2024-11-09 23:22:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546143158] [2024-11-09 23:22:23,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 23:22:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 23:22:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 23:22:23,834 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 25 states have call successors, (35), 1 states have call predecessors, (35), 13 states have return successors, (42), 22 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-09 23:22:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:24,344 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2024-11-09 23:22:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 23:22:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 25 states have call successors, (35), 1 states have call predecessors, (35), 13 states have return successors, (42), 22 states have call predecessors, (42), 25 states have call successors, (42) Word has length 216 [2024-11-09 23:22:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:24,346 INFO L225 Difference]: With dead ends: 198 [2024-11-09 23:22:24,346 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 23:22:24,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 469 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=471, Invalid=2609, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 23:22:24,349 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:24,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 399 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:22:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 23:22:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-09 23:22:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 70 states have internal predecessors, (79), 16 states have call successors, (16), 13 states have call predecessors, (16), 12 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-09 23:22:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-09 23:22:24,357 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 216 [2024-11-09 23:22:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:24,357 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-09 23:22:24,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 25 states have call successors, (35), 1 states have call predecessors, (35), 13 states have return successors, (42), 22 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-09 23:22:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-09 23:22:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 23:22:24,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:24,359 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:24,376 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-09 23:22:24,562 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-09 23:22:24,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:24,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2114532088, now seen corresponding path program 6 times [2024-11-09 23:22:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647231854] [2024-11-09 23:22:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:24,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:22:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:24,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:22:24,630 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:22:24,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:22:24,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:22:24,635 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:24,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:22:24,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:22:24 BoogieIcfgContainer [2024-11-09 23:22:24,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:22:24,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:22:24,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:22:24,701 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:22:24,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:01" (3/4) ... [2024-11-09 23:22:24,702 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:22:24,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:22:24,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:22:24,782 INFO L158 Benchmark]: Toolchain (without parser) took 24019.26ms. Allocated memory was 174.1MB in the beginning and 360.7MB in the end (delta: 186.6MB). Free memory was 122.7MB in the beginning and 197.5MB in the end (delta: -74.8MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,784 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:24,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.03ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 110.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.11ms. Allocated memory is still 174.1MB. Free memory was 110.4MB in the beginning and 108.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:24,785 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 174.1MB. Free memory was 108.9MB in the beginning and 107.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,785 INFO L158 Benchmark]: IcfgBuilder took 327.84ms. Allocated memory is still 174.1MB. Free memory was 107.2MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,785 INFO L158 Benchmark]: TraceAbstraction took 23290.76ms. Allocated memory was 174.1MB in the beginning and 360.7MB in the end (delta: 186.6MB). Free memory was 95.4MB in the beginning and 202.7MB in the end (delta: -107.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,786 INFO L158 Benchmark]: Witness Printer took 80.61ms. Allocated memory is still 360.7MB. Free memory was 202.7MB in the beginning and 197.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:22:24,787 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.19ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.03ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 110.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.11ms. Allocated memory is still 174.1MB. Free memory was 110.4MB in the beginning and 108.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 174.1MB. Free memory was 108.9MB in the beginning and 107.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 327.84ms. Allocated memory is still 174.1MB. Free memory was 107.2MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23290.76ms. Allocated memory was 174.1MB in the beginning and 360.7MB in the end (delta: 186.6MB). Free memory was 95.4MB in the beginning and 202.7MB in the end (delta: -107.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 80.61ms. Allocated memory is still 360.7MB. Free memory was 202.7MB in the beginning and 197.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) 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); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [x=6] [L41] reach_error() VAL [x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 3846 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3405 mSDsCounter, 562 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5019 IncrementalHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 562 mSolverCounterUnsat, 441 mSDtfsCounter, 5019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3466 GetRequests, 3052 SyntacticMatches, 58 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3416 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 142 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 3002 NumberOfCodeBlocks, 2803 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 4191 ConstructedInterpolants, 0 QuantifiedInterpolants, 7295 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2837 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 15135/19143 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-09 23:22:24,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE