./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:58:45,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:58:45,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:58:45,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:58:45,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:58:45,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:58:45,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:58:45,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:58:45,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:58:45,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:58:45,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:58:45,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:58:45,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:58:45,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:58:45,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:58:45,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:58:45,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:58:45,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:58:45,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:58:45,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:58:45,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:58:45,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:58:45,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:58:45,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:58:45,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:58:45,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:58:45,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:58:45,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:58:45,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:58:45,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:58:45,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:58:45,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:58:45,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:58:45,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:58:45,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:58:45,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:58:45,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:58:45,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:58:45,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:58:45,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:58:45,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:58:45,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:58:45,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2024-11-16 07:58:45,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:58:45,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:58:45,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:58:45,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:58:45,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:58:45,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-16 07:58:47,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:58:47,385 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:58:47,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-16 07:58:47,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce658391/b8ff08a9adbe415aa6cb5f43841b24f4/FLAG39bf79d7a [2024-11-16 07:58:47,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce658391/b8ff08a9adbe415aa6cb5f43841b24f4 [2024-11-16 07:58:47,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:58:47,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:58:47,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:58:47,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:58:47,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:58:47,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:58:47" (1/1) ... [2024-11-16 07:58:47,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f22955a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:47, skipping insertion in model container [2024-11-16 07:58:47,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:58:47" (1/1) ... [2024-11-16 07:58:47,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:58:47,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-16 07:58:47,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:58:48,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:58:48,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-16 07:58:48,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:58:48,041 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:58:48,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48 WrapperNode [2024-11-16 07:58:48,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:58:48,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:58:48,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:58:48,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:58:48,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,070 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-16 07:58:48,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:58:48,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:58:48,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:58:48,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:58:48,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,092 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-16 07:58:48,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:58:48,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:58:48,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:58:48,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:58:48,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (1/1) ... [2024-11-16 07:58:48,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:58:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:48,136 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-16 07:58:48,139 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-16 07:58:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:58:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:58:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-16 07:58:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-16 07:58:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-16 07:58:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-16 07:58:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:58:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:58:48,239 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:58:48,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:58:48,328 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2024-11-16 07:58:48,346 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2024-11-16 07:58:48,355 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 07:58:48,356 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:58:48,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:58:48,367 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:58:48,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:48 BoogieIcfgContainer [2024-11-16 07:58:48,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:58:48,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:58:48,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:58:48,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:58:48,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:58:47" (1/3) ... [2024-11-16 07:58:48,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24891cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:58:48, skipping insertion in model container [2024-11-16 07:58:48,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:48" (2/3) ... [2024-11-16 07:58:48,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24891cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:58:48, skipping insertion in model container [2024-11-16 07:58:48,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:48" (3/3) ... [2024-11-16 07:58:48,374 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2024-11-16 07:58:48,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:58:48,397 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:58:48,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:58:48,464 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;@6cdabc0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:58:48,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:58:48,468 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-16 07:58:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 07:58:48,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:48,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:48,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1889766502, now seen corresponding path program 1 times [2024-11-16 07:58:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:48,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270655334] [2024-11-16 07:58:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:48,758 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-16 07:58:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270655334] [2024-11-16 07:58:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270655334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:58:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:58:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:58:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410166967] [2024-11-16 07:58:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:58:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:58:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:48,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:58:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:58:48,794 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-16 07:58:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:48,852 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-16 07:58:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:58:48,857 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-16 07:58:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:48,863 INFO L225 Difference]: With dead ends: 42 [2024-11-16 07:58:48,864 INFO L226 Difference]: Without dead ends: 28 [2024-11-16 07:58:48,867 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-16 07:58:48,870 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-16 07:58:48,872 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-16 07:58:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-16 07:58:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-16 07:58:48,901 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-16 07:58:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-16 07:58:48,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-16 07:58:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:48,904 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-16 07:58:48,904 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-16 07:58:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-16 07:58:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 07:58:48,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:48,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:48,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:58:48,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1119543594, now seen corresponding path program 1 times [2024-11-16 07:58:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407523569] [2024-11-16 07:58:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,056 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-16 07:58:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407523569] [2024-11-16 07:58:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407523569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:58:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:58:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:58:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370183737] [2024-11-16 07:58:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:58:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:58:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:58:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:58:49,063 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-16 07:58:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:49,088 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-16 07:58:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:58:49,089 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-16 07:58:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:49,090 INFO L225 Difference]: With dead ends: 35 [2024-11-16 07:58:49,090 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 07:58:49,091 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-16 07:58:49,093 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-16 07:58:49,094 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-16 07:58:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 07:58:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-16 07:58:49,102 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-16 07:58:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-16 07:58:49,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 12 [2024-11-16 07:58:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:49,104 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-16 07:58:49,104 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-16 07:58:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-16 07:58:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 07:58:49,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:49,105 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-16 07:58:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:58:49,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:49,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2127390698, now seen corresponding path program 1 times [2024-11-16 07:58:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765367404] [2024-11-16 07:58:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 07:58:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,310 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-16 07:58:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765367404] [2024-11-16 07:58:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765367404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130610129] [2024-11-16 07:58:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:49,314 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-16 07:58:49,315 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-16 07:58:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:49,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:58:49,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:49,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-16 07:58:49,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:49,743 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-16 07:58:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130610129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:49,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-16 07:58:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985661973] [2024-11-16 07:58:49,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:49,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:58:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:58:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:58:49,746 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-16 07:58:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:49,881 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-16 07:58:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:58:49,882 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-16 07:58:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:49,883 INFO L225 Difference]: With dead ends: 57 [2024-11-16 07:58:49,883 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 07:58:49,884 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-16 07:58:49,885 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-16 07:58:49,885 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-16 07:58:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 07:58:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-16 07:58:49,893 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-16 07:58:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 07:58:49,897 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-16 07:58:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 07:58:49,898 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-16 07:58:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 07:58:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 07:58:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:49,899 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-16 07:58:49,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:58:50,104 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-16 07:58:50,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2059978289, now seen corresponding path program 1 times [2024-11-16 07:58:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956747612] [2024-11-16 07:58:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:50,309 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-16 07:58:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956747612] [2024-11-16 07:58:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956747612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98979264] [2024-11-16 07:58:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:50,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:50,316 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-16 07:58:50,318 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-16 07:58:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:50,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:58:50,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:50,419 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-16 07:58:50,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:50,622 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-16 07:58:50,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98979264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:50,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-16 07:58:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881497657] [2024-11-16 07:58:50,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:58:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:58:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:58:50,627 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-16 07:58:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:50,808 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2024-11-16 07:58:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:58:50,808 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-16 07:58:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:50,810 INFO L225 Difference]: With dead ends: 55 [2024-11-16 07:58:50,810 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 07:58:50,811 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-16 07:58:50,814 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:50,815 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.2s Time] [2024-11-16 07:58:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 07:58:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-16 07:58:50,828 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-16 07:58:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-11-16 07:58:50,830 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 25 [2024-11-16 07:58:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:50,830 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-11-16 07:58:50,830 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-16 07:58:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-11-16 07:58:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 07:58:50,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:50,832 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-16 07:58:50,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 07:58:51,033 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-16 07:58:51,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:51,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -747014037, now seen corresponding path program 1 times [2024-11-16 07:58:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297178390] [2024-11-16 07:58:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 07:58:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:58:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,164 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-16 07:58:51,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297178390] [2024-11-16 07:58:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297178390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259658422] [2024-11-16 07:58:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:51,173 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-16 07:58:51,175 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-16 07:58:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:51,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:58:51,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:51,317 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-16 07:58:51,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:51,652 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-16 07:58:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259658422] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:51,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-16 07:58:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144198422] [2024-11-16 07:58:51,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:51,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 07:58:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 07:58:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:58:51,656 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-16 07:58:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:51,871 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2024-11-16 07:58:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 07:58:51,873 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-16 07:58:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:51,875 INFO L225 Difference]: With dead ends: 111 [2024-11-16 07:58:51,878 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 07:58:51,879 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-16 07:58:51,879 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:51,880 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.1s Time] [2024-11-16 07:58:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 07:58:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-16 07:58:51,896 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-16 07:58:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-16 07:58:51,898 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 37 [2024-11-16 07:58:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-16 07:58:51,898 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-16 07:58:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-16 07:58:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 07:58:51,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:51,900 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-16 07:58:51,917 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-16 07:58:52,100 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-16 07:58:52,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 335870733, now seen corresponding path program 1 times [2024-11-16 07:58:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198222208] [2024-11-16 07:58:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,248 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-16 07:58:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:52,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198222208] [2024-11-16 07:58:52,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198222208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:52,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478062330] [2024-11-16 07:58:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:52,251 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-16 07:58:52,253 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-16 07:58:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:52,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:58:52,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:52,389 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-16 07:58:52,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:52,722 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-16 07:58:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478062330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:52,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-16 07:58:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189924138] [2024-11-16 07:58:52,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:52,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 07:58:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 07:58:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-16 07:58:52,727 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-16 07:58:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:53,032 INFO L93 Difference]: Finished difference Result 181 states and 327 transitions. [2024-11-16 07:58:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 07:58:53,032 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-16 07:58:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:53,035 INFO L225 Difference]: With dead ends: 181 [2024-11-16 07:58:53,035 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 07:58:53,037 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-16 07:58:53,037 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-16 07:58:53,038 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-16 07:58:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 07:58:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-11-16 07:58:53,069 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-16 07:58:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2024-11-16 07:58:53,071 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 38 [2024-11-16 07:58:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2024-11-16 07:58:53,072 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-16 07:58:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2024-11-16 07:58:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 07:58:53,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:53,075 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-16 07:58:53,089 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-16 07:58:53,276 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-16 07:58:53,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:53,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash -37020151, now seen corresponding path program 1 times [2024-11-16 07:58:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954817435] [2024-11-16 07:58:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:58:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,501 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-16 07:58:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954817435] [2024-11-16 07:58:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954817435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483950141] [2024-11-16 07:58:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:53,504 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-16 07:58:53,505 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-16 07:58:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:53,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 07:58:53,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:53,676 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-16 07:58:53,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:54,176 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-16 07:58:54,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483950141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:54,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:54,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-11-16 07:58:54,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611007491] [2024-11-16 07:58:54,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:54,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 07:58:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 07:58:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-16 07:58:54,179 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-16 07:58:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:54,564 INFO L93 Difference]: Finished difference Result 251 states and 488 transitions. [2024-11-16 07:58:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 07:58:54,565 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-16 07:58:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:54,568 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:58:54,568 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 07:58:54,572 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-16 07:58:54,574 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-16 07:58:54,576 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-16 07:58:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 07:58:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2024-11-16 07:58:54,608 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-16 07:58:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 178 transitions. [2024-11-16 07:58:54,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 178 transitions. Word has length 52 [2024-11-16 07:58:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 178 transitions. [2024-11-16 07:58:54,613 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-16 07:58:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 178 transitions. [2024-11-16 07:58:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 07:58:54,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:54,618 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-16 07:58:54,636 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-16 07:58:54,822 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-16 07:58:54,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:54,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash -717502930, now seen corresponding path program 1 times [2024-11-16 07:58:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:54,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573621245] [2024-11-16 07:58:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 07:58:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,147 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-16 07:58:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573621245] [2024-11-16 07:58:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573621245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302932056] [2024-11-16 07:58:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:55,150 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-16 07:58:55,151 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-16 07:58:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:55,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 07:58:55,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:55,366 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-16 07:58:55,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:56,199 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-16 07:58:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302932056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:56,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2024-11-16 07:58:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489723412] [2024-11-16 07:58:56,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 07:58:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:56,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 07:58:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-11-16 07:58:56,202 INFO L87 Difference]: Start difference. First operand 110 states and 178 transitions. Second operand has 24 states, 22 states have (on average 3.409090909090909) internal successors, (75), 24 states have internal predecessors, (75), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-16 07:58:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:56,681 INFO L93 Difference]: Finished difference Result 255 states and 493 transitions. [2024-11-16 07:58:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 07:58:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.409090909090909) internal successors, (75), 24 states have internal predecessors, (75), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) Word has length 80 [2024-11-16 07:58:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:56,683 INFO L225 Difference]: With dead ends: 255 [2024-11-16 07:58:56,683 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 07:58:56,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 07:58:56,686 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:56,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 309 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:58:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 07:58:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2024-11-16 07:58:56,700 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-16 07:58:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-16 07:58:56,702 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 80 [2024-11-16 07:58:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:56,702 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-16 07:58:56,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.409090909090909) internal successors, (75), 24 states have internal predecessors, (75), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-16 07:58:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-16 07:58:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 07:58:56,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:56,704 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:56,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 07:58:56,908 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-16 07:58:56,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 528093242, now seen corresponding path program 1 times [2024-11-16 07:58:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:56,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826613902] [2024-11-16 07:58:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 07:58:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:58:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 07:58:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 67 proven. 169 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-11-16 07:58:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826613902] [2024-11-16 07:58:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826613902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315070137] [2024-11-16 07:58:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:57,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:57,338 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-16 07:58:57,339 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-16 07:58:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:57,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 07:58:57,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-16 07:58:57,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 266 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2024-11-16 07:58:58,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315070137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:58,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2024-11-16 07:58:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050010236] [2024-11-16 07:58:58,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 07:58:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 07:58:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-16 07:58:58,719 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2024-11-16 07:58:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:59,171 INFO L93 Difference]: Finished difference Result 228 states and 394 transitions. [2024-11-16 07:58:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 07:58:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 162 [2024-11-16 07:58:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:59,173 INFO L225 Difference]: With dead ends: 228 [2024-11-16 07:58:59,173 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 07:58:59,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 350 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 07:58:59,176 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:59,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 324 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:58:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 07:58:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2024-11-16 07:58:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 75 states have internal predecessors, (90), 20 states have call successors, (20), 11 states have call predecessors, (20), 14 states have return successors, (51), 22 states have call predecessors, (51), 20 states have call successors, (51) [2024-11-16 07:58:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-16 07:58:59,195 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 162 [2024-11-16 07:58:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:59,195 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-16 07:58:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2024-11-16 07:58:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-16 07:58:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-16 07:58:59,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:59,202 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 16, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:59,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 07:58:59,403 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-16 07:58:59,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:59,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1692825150, now seen corresponding path program 1 times [2024-11-16 07:58:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:59,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181045209] [2024-11-16 07:58:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:59,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:59:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-16 07:59:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 184 proven. 369 refuted. 0 times theorem prover too weak. 1647 trivial. 0 not checked. [2024-11-16 07:59:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181045209] [2024-11-16 07:59:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181045209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382325235] [2024-11-16 07:59:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:00,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:00,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:00,182 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-16 07:59:00,185 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-16 07:59:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:00,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 07:59:00,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 94 proven. 554 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2024-11-16 07:59:00,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 94 proven. 578 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2024-11-16 07:59:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382325235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:02,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:02,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 27 [2024-11-16 07:59:02,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351012638] [2024-11-16 07:59:02,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:02,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-16 07:59:02,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-16 07:59:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-16 07:59:02,391 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 27 states have internal predecessors, (92), 21 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-16 07:59:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:02,908 INFO L93 Difference]: Finished difference Result 253 states and 431 transitions. [2024-11-16 07:59:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 07:59:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 27 states have internal predecessors, (92), 21 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 283 [2024-11-16 07:59:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:02,911 INFO L225 Difference]: With dead ends: 253 [2024-11-16 07:59:02,911 INFO L226 Difference]: Without dead ends: 154 [2024-11-16 07:59:02,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 626 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 07:59:02,914 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:02,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 341 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:59:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-16 07:59:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2024-11-16 07:59:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 97 states have internal predecessors, (122), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (71), 26 states have call predecessors, (71), 26 states have call successors, (71) [2024-11-16 07:59:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 219 transitions. [2024-11-16 07:59:02,942 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 219 transitions. Word has length 283 [2024-11-16 07:59:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:02,942 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 219 transitions. [2024-11-16 07:59:02,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 27 states have internal predecessors, (92), 21 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-16 07:59:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 219 transitions. [2024-11-16 07:59:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-11-16 07:59:02,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:02,951 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 33, 33, 29, 28, 19, 19, 19, 19, 19, 19, 19, 16, 16, 16, 16, 16, 16, 16, 12, 10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:02,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 07:59:03,152 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-16 07:59:03,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1738199206, now seen corresponding path program 2 times [2024-11-16 07:59:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946491136] [2024-11-16 07:59:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:59:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 07:59:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-16 07:59:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:59:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 07:59:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 265 proven. 869 refuted. 0 times theorem prover too weak. 5738 trivial. 0 not checked. [2024-11-16 07:59:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946491136] [2024-11-16 07:59:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946491136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615644733] [2024-11-16 07:59:04,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 07:59:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:04,410 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-16 07:59:04,412 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-16 07:59:04,635 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 07:59:04,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:59:04,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 07:59:04,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 213 proven. 853 refuted. 0 times theorem prover too weak. 5806 trivial. 0 not checked. [2024-11-16 07:59:04,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 213 proven. 869 refuted. 0 times theorem prover too weak. 5790 trivial. 0 not checked. [2024-11-16 07:59:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615644733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:06,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 25 [2024-11-16 07:59:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654791725] [2024-11-16 07:59:06,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:06,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 07:59:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 07:59:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-16 07:59:06,875 INFO L87 Difference]: Start difference. First operand 141 states and 219 transitions. Second operand has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2024-11-16 07:59:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:07,291 INFO L93 Difference]: Finished difference Result 318 states and 526 transitions. [2024-11-16 07:59:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 07:59:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) Word has length 488 [2024-11-16 07:59:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:07,294 INFO L225 Difference]: With dead ends: 318 [2024-11-16 07:59:07,294 INFO L226 Difference]: Without dead ends: 187 [2024-11-16 07:59:07,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1101 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 07:59:07,296 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 76 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:07,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 274 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:59:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-16 07:59:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-11-16 07:59:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.2) internal successors, (120), 99 states have internal predecessors, (120), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (70), 27 states have call predecessors, (70), 26 states have call successors, (70) [2024-11-16 07:59:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2024-11-16 07:59:07,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 488 [2024-11-16 07:59:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:07,312 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2024-11-16 07:59:07,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2024-11-16 07:59:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2024-11-16 07:59:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-16 07:59:07,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:07,321 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 30, 30, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:07,340 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-16 07:59:07,521 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-16 07:59:07,522 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:07,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 670967157, now seen corresponding path program 3 times [2024-11-16 07:59:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683304436] [2024-11-16 07:59:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:59:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-16 07:59:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-16 07:59:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:59:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:59:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:59:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:59:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:59:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 834 proven. 729 refuted. 0 times theorem prover too weak. 3814 trivial. 0 not checked. [2024-11-16 07:59:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:09,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683304436] [2024-11-16 07:59:09,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683304436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:09,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503333912] [2024-11-16 07:59:09,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 07:59:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:09,135 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-16 07:59:09,136 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-16 07:59:09,305 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-16 07:59:09,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:59:09,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 07:59:09,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 680 proven. 103 refuted. 0 times theorem prover too weak. 4594 trivial. 0 not checked. [2024-11-16 07:59:09,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 684 proven. 109 refuted. 0 times theorem prover too weak. 4584 trivial. 0 not checked. [2024-11-16 07:59:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503333912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:10,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:10,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 13] total 36 [2024-11-16 07:59:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878955104] [2024-11-16 07:59:10,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:10,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-16 07:59:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-16 07:59:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 07:59:10,878 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand has 36 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 36 states have internal predecessors, (97), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (40), 28 states have call predecessors, (40), 21 states have call successors, (40) [2024-11-16 07:59:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:11,569 INFO L93 Difference]: Finished difference Result 372 states and 611 transitions. [2024-11-16 07:59:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-16 07:59:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 36 states have internal predecessors, (97), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (40), 28 states have call predecessors, (40), 21 states have call successors, (40) Word has length 434 [2024-11-16 07:59:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:11,573 INFO L225 Difference]: With dead ends: 372 [2024-11-16 07:59:11,573 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 07:59:11,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 976 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=2638, Unknown=0, NotChecked=0, Total=3080 [2024-11-16 07:59:11,575 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 132 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:11,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 536 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 07:59:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 07:59:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2024-11-16 07:59:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 112 states have internal predecessors, (137), 31 states have call successors, (31), 21 states have call predecessors, (31), 17 states have return successors, (70), 28 states have call predecessors, (70), 31 states have call successors, (70) [2024-11-16 07:59:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-16 07:59:11,589 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 434 [2024-11-16 07:59:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:11,590 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-16 07:59:11,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 36 states have internal predecessors, (97), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (40), 28 states have call predecessors, (40), 21 states have call successors, (40) [2024-11-16 07:59:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-16 07:59:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-16 07:59:11,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:11,593 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:11,611 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-16 07:59:11,797 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-16 07:59:11,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:11,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash -14791359, now seen corresponding path program 4 times [2024-11-16 07:59:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:11,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412462661] [2024-11-16 07:59:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:59:11,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:59:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:59:11,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:59:11,976 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:59:11,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:59:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 07:59:11,981 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:12,086 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:59:12,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:59:12 BoogieIcfgContainer [2024-11-16 07:59:12,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:59:12,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:59:12,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:59:12,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:59:12,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:48" (3/4) ... [2024-11-16 07:59:12,090 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:59:12,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:59:12,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:59:12,196 INFO L158 Benchmark]: Toolchain (without parser) took 24408.39ms. Allocated memory was 165.7MB in the beginning and 423.6MB in the end (delta: 257.9MB). Free memory was 112.4MB in the beginning and 241.9MB in the end (delta: -129.5MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,196 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:59:12,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.61ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.46ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,197 INFO L158 Benchmark]: Boogie Preprocessor took 27.15ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 96.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:59:12,197 INFO L158 Benchmark]: IcfgBuilder took 267.37ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 84.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,198 INFO L158 Benchmark]: TraceAbstraction took 23719.25ms. Allocated memory was 165.7MB in the beginning and 423.6MB in the end (delta: 257.9MB). Free memory was 83.8MB in the beginning and 251.4MB in the end (delta: -167.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,198 INFO L158 Benchmark]: Witness Printer took 106.82ms. Allocated memory is still 423.6MB. Free memory was 251.4MB in the beginning and 241.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 07:59:12,200 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 165.7MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.61ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.46ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.15ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 96.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.37ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 84.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23719.25ms. Allocated memory was 165.7MB in the beginning and 423.6MB in the end (delta: 257.9MB). Free memory was 83.8MB in the beginning and 251.4MB in the end (delta: -167.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 106.82ms. Allocated memory is still 423.6MB. Free memory was 251.4MB in the beginning and 241.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 13, TraceHistogramMax: 38, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 3033 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2656 mSDsCounter, 671 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4089 IncrementalHoareTripleChecker+Invalid, 4760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 671 mSolverCounterUnsat, 377 mSDtfsCounter, 4089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3937 GetRequests, 3590 SyntacticMatches, 46 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=12, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 218 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 3730 NumberOfCodeBlocks, 3417 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4860 ConstructedInterpolants, 0 QuantifiedInterpolants, 7292 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3094 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 40092/46113 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-16 07:59:12,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE