./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:03:56,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:03:56,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:03:56,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:03:56,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:03:56,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:03:56,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:03:56,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:03:56,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:03:56,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:03:56,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:03:56,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:03:56,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:03:56,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:03:56,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:03:56,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:03:56,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:03:56,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:03:56,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:03:56,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:03:56,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:03:56,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:03:56,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:03:56,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:03:56,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:03:56,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:03:56,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:03:56,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:03:56,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:03:56,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:03:56,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:03:56,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:03:56,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:03:56,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:03:56,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:03:56,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:03:56,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:03:56,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:03:56,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:03:56,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:03:56,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:03:56,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:03:56,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 [2024-10-11 03:03:57,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:03:57,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:03:57,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:03:57,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:03:57,079 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:03:57,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-10-11 03:03:58,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:03:58,552 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:03:58,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-10-11 03:03:58,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f7af2e6f/3c6b7e0d14e84a96af2a6027f458dbb7/FLAG096eab92d [2024-10-11 03:03:58,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f7af2e6f/3c6b7e0d14e84a96af2a6027f458dbb7 [2024-10-11 03:03:58,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:03:58,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:03:58,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:03:58,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:03:59,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:03:59,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:03:58" (1/1) ... [2024-10-11 03:03:59,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7a7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59, skipping insertion in model container [2024-10-11 03:03:59,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:03:58" (1/1) ... [2024-10-11 03:03:59,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:03:59,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-10-11 03:03:59,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:03:59,331 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:03:59,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-10-11 03:03:59,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:03:59,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:03:59,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59 WrapperNode [2024-10-11 03:03:59,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:03:59,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:03:59,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:03:59,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:03:59,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,451 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-11 03:03:59,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:03:59,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:03:59,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:03:59,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:03:59,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:03:59,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:03:59,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:03:59,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:03:59,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:03:59,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (1/1) ... [2024-10-11 03:03:59,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:03:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:03:59,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:03:59,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:03:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:03:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:03:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-11 03:03:59,622 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-11 03:03:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-11 03:03:59,622 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-11 03:03:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:03:59,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:03:59,681 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:03:59,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:03:59,783 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 03:03:59,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:03:59,806 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:03:59,807 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:03:59,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:03:59 BoogieIcfgContainer [2024-10-11 03:03:59,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:03:59,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:03:59,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:03:59,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:03:59,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:03:58" (1/3) ... [2024-10-11 03:03:59,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4443ba54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:03:59, skipping insertion in model container [2024-10-11 03:03:59,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:03:59" (2/3) ... [2024-10-11 03:03:59,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4443ba54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:03:59, skipping insertion in model container [2024-10-11 03:03:59,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:03:59" (3/3) ... [2024-10-11 03:03:59,815 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2024-10-11 03:03:59,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:03:59,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:03:59,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:03:59,896 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;@55d0eee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:03:59,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:03:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-10-11 03:03:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:03:59,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:03:59,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:03:59,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:03:59,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:03:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-10-11 03:03:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:03:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649334305] [2024-10-11 03:03:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:03:59,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649334305] [2024-10-11 03:04:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649334305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:00,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:00,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852921052] [2024-10-11 03:04:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:00,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:00,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:00,248 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:00,306 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-10-11 03:04:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 03:04:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:00,314 INFO L225 Difference]: With dead ends: 36 [2024-10-11 03:04:00,315 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 03:04:00,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:00,321 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:00,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:04:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 03:04:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 03:04:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 03:04:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:00,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-10-11 03:04:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:00,383 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:00,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:04:00,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:00,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:04:00,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-10-11 03:04:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959911566] [2024-10-11 03:04:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959911566] [2024-10-11 03:04:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959911566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509956314] [2024-10-11 03:04:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:00,553 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:00,624 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 03:04:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:00,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 03:04:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:00,627 INFO L225 Difference]: With dead ends: 32 [2024-10-11 03:04:00,628 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 03:04:00,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:00,630 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:00,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 03:04:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 03:04:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 03:04:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:00,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-10-11 03:04:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:00,645 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:04:00,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:00,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:00,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:04:00,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:00,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-10-11 03:04:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:00,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517335183] [2024-10-11 03:04:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:00,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517335183] [2024-10-11 03:04:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517335183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49992509] [2024-10-11 03:04:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:00,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:00,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:00,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:00,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:04:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:00,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:00,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:00,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49992509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:01,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:01,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-11 03:04:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578636181] [2024-10-11 03:04:01,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:01,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:01,169 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:04:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:01,295 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-10-11 03:04:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:01,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-10-11 03:04:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:01,297 INFO L225 Difference]: With dead ends: 54 [2024-10-11 03:04:01,297 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 03:04:01,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 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-10-11 03:04:01,298 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:01,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 03:04:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-11 03:04:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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-10-11 03:04:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-11 03:04:01,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-10-11 03:04:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:01,305 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-11 03:04:01,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:04:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-11 03:04:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:04:01,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:01,306 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] [2024-10-11 03:04:01,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:04:01,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:01,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-10-11 03:04:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120041557] [2024-10-11 03:04:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:01,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-10-11 03:04:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120041557] [2024-10-11 03:04:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120041557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081646063] [2024-10-11 03:04:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:01,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:01,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:04:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:01,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:01,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:01,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081646063] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:02,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-11 03:04:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197959723] [2024-10-11 03:04:02,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:02,027 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:02,176 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-10-11 03:04:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:02,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-10-11 03:04:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:02,178 INFO L225 Difference]: With dead ends: 52 [2024-10-11 03:04:02,178 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 03:04:02,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-10-11 03:04:02,179 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:02,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 114 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 03:04:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-11 03:04:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 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-10-11 03:04:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-11 03:04:02,187 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-10-11 03:04:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-11 03:04:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-11 03:04:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:04:02,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:02,190 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] [2024-10-11 03:04:02,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:02,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-10-11 03:04:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737485034] [2024-10-11 03:04:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 03:04:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:04:02,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737485034] [2024-10-11 03:04:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737485034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376308072] [2024-10-11 03:04:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:02,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:02,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:02,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:02,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:04:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:02,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:02,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:04:02,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376308072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:02,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-10-11 03:04:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498369304] [2024-10-11 03:04:02,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:04:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:04:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:04:02,939 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-11 03:04:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:03,114 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-10-11 03:04:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:04:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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 35 [2024-10-11 03:04:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:03,117 INFO L225 Difference]: With dead ends: 108 [2024-10-11 03:04:03,117 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 03:04:03,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:03,119 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:03,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 119 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 03:04:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 03:04:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 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-10-11 03:04:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-10-11 03:04:03,131 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-10-11 03:04:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:03,132 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-10-11 03:04:03,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-11 03:04:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-10-11 03:04:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:04:03,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:03,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:03,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:04:03,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:03,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:03,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-10-11 03:04:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586900179] [2024-10-11 03:04:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:04:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586900179] [2024-10-11 03:04:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586900179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43913107] [2024-10-11 03:04:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:03,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:03,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:03,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:04:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:03,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:03,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:04:03,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:03,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43913107] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:03,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:03,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-10-11 03:04:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840956956] [2024-10-11 03:04:03,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:03,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:04:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:04:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:04:03,829 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-11 03:04:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:04,048 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-10-11 03:04:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:04:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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 36 [2024-10-11 03:04:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:04,050 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:04:04,050 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 03:04:04,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 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-10-11 03:04:04,052 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:04,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 03:04:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-10-11 03:04:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 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-10-11 03:04:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-10-11 03:04:04,091 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-10-11 03:04:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-10-11 03:04:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-11 03:04:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-10-11 03:04:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:04:04,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:04,094 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] [2024-10-11 03:04:04,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:04:04,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-10-11 03:04:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573288293] [2024-10-11 03:04:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:04:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 03:04:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573288293] [2024-10-11 03:04:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573288293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591468172] [2024-10-11 03:04:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:04,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:04,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:04:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:04,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:04,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:04:04,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:04:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591468172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:05,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-10-11 03:04:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342474962] [2024-10-11 03:04:05,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:04:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:04:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:04:05,064 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 03:04:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:05,368 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2024-10-11 03:04:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:04:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) Word has length 50 [2024-10-11 03:04:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:05,371 INFO L225 Difference]: With dead ends: 248 [2024-10-11 03:04:05,371 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 03:04:05,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:05,373 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 28 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:05,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 250 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 03:04:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2024-10-11 03:04:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 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-10-11 03:04:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2024-10-11 03:04:05,404 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2024-10-11 03:04:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2024-10-11 03:04:05,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 03:04:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2024-10-11 03:04:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:04:05,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:05,411 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:05,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:04:05,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:05,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -988387816, now seen corresponding path program 1 times [2024-10-11 03:04:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328661531] [2024-10-11 03:04:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 03:04:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328661531] [2024-10-11 03:04:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328661531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880754135] [2024-10-11 03:04:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:05,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:04:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:06,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:06,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 03:04:06,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-11 03:04:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880754135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:06,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-10-11 03:04:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164847252] [2024-10-11 03:04:06,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:06,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:04:06,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:04:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:04:06,454 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-10-11 03:04:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:06,783 INFO L93 Difference]: Finished difference Result 250 states and 492 transitions. [2024-10-11 03:04:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:04:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 92 [2024-10-11 03:04:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:06,785 INFO L225 Difference]: With dead ends: 250 [2024-10-11 03:04:06,785 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 03:04:06,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:06,787 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:06,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 255 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 03:04:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2024-10-11 03:04:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 74 states have internal predecessors, (90), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (60), 24 states have call predecessors, (60), 23 states have call successors, (60) [2024-10-11 03:04:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-11 03:04:06,802 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 92 [2024-10-11 03:04:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:06,802 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-11 03:04:06,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-10-11 03:04:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-11 03:04:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 03:04:06,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:06,804 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:06,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:04:07,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:07,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2009440644, now seen corresponding path program 2 times [2024-10-11 03:04:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413064149] [2024-10-11 03:04:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:04:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 62 proven. 124 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-11 03:04:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413064149] [2024-10-11 03:04:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413064149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265776251] [2024-10-11 03:04:07,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:04:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:07,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:07,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:04:07,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:04:07,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:07,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:04:07,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 77 proven. 83 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-11 03:04:07,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 77 proven. 91 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-11 03:04:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265776251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:08,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:08,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 13] total 26 [2024-10-11 03:04:08,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67842064] [2024-10-11 03:04:08,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:04:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:08,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:04:08,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:08,262 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 26 states, 25 states have (on average 3.2) internal successors, (80), 26 states have internal predecessors, (80), 19 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 15 states have call predecessors, (31), 19 states have call successors, (31) [2024-10-11 03:04:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:08,679 INFO L93 Difference]: Finished difference Result 268 states and 507 transitions. [2024-10-11 03:04:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 03:04:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 26 states have internal predecessors, (80), 19 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 15 states have call predecessors, (31), 19 states have call successors, (31) Word has length 119 [2024-10-11 03:04:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:08,682 INFO L225 Difference]: With dead ends: 268 [2024-10-11 03:04:08,682 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 03:04:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 255 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:04:08,684 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:08,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 332 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 03:04:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2024-10-11 03:04:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 73 states have internal predecessors, (87), 21 states have call successors, (21), 12 states have call predecessors, (21), 14 states have return successors, (48), 24 states have call predecessors, (48), 21 states have call successors, (48) [2024-10-11 03:04:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-10-11 03:04:08,697 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 119 [2024-10-11 03:04:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-10-11 03:04:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 26 states have internal predecessors, (80), 19 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 15 states have call predecessors, (31), 19 states have call successors, (31) [2024-10-11 03:04:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-10-11 03:04:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 03:04:08,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:08,699 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:08,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:04:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:08,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1604070482, now seen corresponding path program 3 times [2024-10-11 03:04:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448673889] [2024-10-11 03:04:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 108 proven. 97 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-11 03:04:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448673889] [2024-10-11 03:04:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448673889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186203246] [2024-10-11 03:04:09,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:04:09,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:09,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:09,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:04:09,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 03:04:09,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:09,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:09,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 141 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 03:04:09,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 141 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 03:04:10,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186203246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:10,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 29 [2024-10-11 03:04:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892102069] [2024-10-11 03:04:10,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:10,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:04:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:04:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:04:10,007 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 14 states have call predecessors, (27), 17 states have call successors, (27) [2024-10-11 03:04:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:10,420 INFO L93 Difference]: Finished difference Result 226 states and 354 transitions. [2024-10-11 03:04:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 03:04:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 14 states have call predecessors, (27), 17 states have call successors, (27) Word has length 118 [2024-10-11 03:04:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:10,422 INFO L225 Difference]: With dead ends: 226 [2024-10-11 03:04:10,422 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 03:04:10,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 03:04:10,423 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 87 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:10,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 251 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 03:04:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2024-10-11 03:04:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 71 states have internal predecessors, (88), 17 states have call successors, (17), 16 states have call predecessors, (17), 12 states have return successors, (34), 17 states have call predecessors, (34), 17 states have call successors, (34) [2024-10-11 03:04:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2024-10-11 03:04:10,432 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 118 [2024-10-11 03:04:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2024-10-11 03:04:10,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 14 states have call predecessors, (27), 17 states have call successors, (27) [2024-10-11 03:04:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2024-10-11 03:04:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:04:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:10,434 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:10,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:04:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:04:10,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 453542388, now seen corresponding path program 4 times [2024-10-11 03:04:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959998795] [2024-10-11 03:04:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 03:04:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959998795] [2024-10-11 03:04:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959998795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108253310] [2024-10-11 03:04:10,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:04:10,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:10,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:10,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:10,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:04:10,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:04:10,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:10,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:04:10,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 56 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 03:04:11,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 03:04:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108253310] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:11,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2024-10-11 03:04:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968199052] [2024-10-11 03:04:11,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:11,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:04:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:11,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:04:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:11,680 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 03:04:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:11,925 INFO L93 Difference]: Finished difference Result 206 states and 287 transitions. [2024-10-11 03:04:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:04:11,925 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) Word has length 91 [2024-10-11 03:04:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:11,927 INFO L225 Difference]: With dead ends: 206 [2024-10-11 03:04:11,927 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 03:04:11,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 186 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:04:11,928 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:11,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 343 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 03:04:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-10-11 03:04:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 74 states have internal predecessors, (86), 18 states have call successors, (18), 16 states have call predecessors, (18), 12 states have return successors, (35), 17 states have call predecessors, (35), 18 states have call successors, (35) [2024-10-11 03:04:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2024-10-11 03:04:11,936 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 91 [2024-10-11 03:04:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:11,936 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2024-10-11 03:04:11,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 03:04:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2024-10-11 03:04:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:04:11,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:11,937 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:11,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:12,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:12,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1780776373, now seen corresponding path program 5 times [2024-10-11 03:04:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46522259] [2024-10-11 03:04:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 03:04:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46522259] [2024-10-11 03:04:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46522259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446509897] [2024-10-11 03:04:12,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:04:12,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:12,854 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:12,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:04:12,936 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-11 03:04:12,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:12,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 03:04:12,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 03:04:13,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 03:04:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446509897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:13,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2024-10-11 03:04:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124040665] [2024-10-11 03:04:13,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:13,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:04:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:04:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:04:13,407 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-11 03:04:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:13,553 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2024-10-11 03:04:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:04:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) Word has length 105 [2024-10-11 03:04:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:13,555 INFO L225 Difference]: With dead ends: 123 [2024-10-11 03:04:13,555 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 03:04:13,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:04:13,556 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:13,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 895 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 03:04:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2024-10-11 03:04:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 78 states have internal predecessors, (90), 20 states have call successors, (20), 16 states have call predecessors, (20), 13 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) [2024-10-11 03:04:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2024-10-11 03:04:13,565 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 105 [2024-10-11 03:04:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2024-10-11 03:04:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-11 03:04:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2024-10-11 03:04:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 03:04:13,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:13,566 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:13,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 03:04:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:04:13,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:13,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1334835348, now seen corresponding path program 1 times [2024-10-11 03:04:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931848673] [2024-10-11 03:04:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:04:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-11 03:04:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:14,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931848673] [2024-10-11 03:04:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931848673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116530522] [2024-10-11 03:04:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:14,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:14,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:14,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:14,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 03:04:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:04:14,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 133 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-11 03:04:14,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 147 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-10-11 03:04:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116530522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:15,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 24 [2024-10-11 03:04:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121040440] [2024-10-11 03:04:15,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:15,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:04:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:15,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:04:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:04:15,170 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (31), 10 states have call predecessors, (31), 19 states have call successors, (31) [2024-10-11 03:04:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:15,396 INFO L93 Difference]: Finished difference Result 225 states and 298 transitions. [2024-10-11 03:04:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:04:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (31), 10 states have call predecessors, (31), 19 states have call successors, (31) Word has length 119 [2024-10-11 03:04:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:15,397 INFO L225 Difference]: With dead ends: 225 [2024-10-11 03:04:15,397 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 03:04:15,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 253 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:04:15,399 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:15,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 363 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 03:04:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 03:04:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 14 states have call successors, (14), 12 states have call predecessors, (14), 9 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 03:04:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-10-11 03:04:15,404 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 119 [2024-10-11 03:04:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:15,404 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-10-11 03:04:15,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (31), 10 states have call predecessors, (31), 19 states have call successors, (31) [2024-10-11 03:04:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-10-11 03:04:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 03:04:15,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:15,406 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:15,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:15,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 03:04:15,607 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:15,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash -187435723, now seen corresponding path program 6 times [2024-10-11 03:04:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796652086] [2024-10-11 03:04:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 92 proven. 147 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-11 03:04:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796652086] [2024-10-11 03:04:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796652086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199205326] [2024-10-11 03:04:15,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:04:15,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:15,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:15,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 03:04:16,085 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-10-11 03:04:16,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:16,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:16,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 127 proven. 29 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-10-11 03:04:16,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 127 proven. 33 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-11 03:04:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199205326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:16,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2024-10-11 03:04:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315417430] [2024-10-11 03:04:16,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:04:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:04:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:04:16,708 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 21 states have call predecessors, (31), 17 states have call successors, (31) [2024-10-11 03:04:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:16,996 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-11 03:04:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:04:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 21 states have call predecessors, (31), 17 states have call successors, (31) Word has length 132 [2024-10-11 03:04:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:16,997 INFO L225 Difference]: With dead ends: 85 [2024-10-11 03:04:16,997 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:04:16,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:04:16,998 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:16,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 239 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:04:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:04:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:04:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:04:16,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2024-10-11 03:04:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:04:17,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 29 states have internal predecessors, (80), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 21 states have call predecessors, (31), 17 states have call successors, (31) [2024-10-11 03:04:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:04:17,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:04:17,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:04:17,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 03:04:17,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 03:04:17,206 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:17,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:04:18,854 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:04:18,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:04:18 BoogieIcfgContainer [2024-10-11 03:04:18,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:04:18,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:04:18,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:04:18,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:04:18,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:03:59" (3/4) ... [2024-10-11 03:04:18,930 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:04:18,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-10-11 03:04:18,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-10-11 03:04:18,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 03:04:18,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:04:18,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:04:18,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:04:19,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:04:19,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:04:19,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:04:19,021 INFO L158 Benchmark]: Toolchain (without parser) took 20027.10ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 96.2MB in the beginning and 386.7MB in the end (delta: -290.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:19,021 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:19,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.82ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 138.6MB in the end (delta: -42.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 03:04:19,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 167.8MB. Free memory was 138.5MB in the beginning and 137.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:19,022 INFO L158 Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 167.8MB. Free memory was 137.1MB in the beginning and 138.6MB in the end (delta: -1.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-11 03:04:19,022 INFO L158 Benchmark]: RCFGBuilder took 305.91ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 127.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:04:19,023 INFO L158 Benchmark]: TraceAbstraction took 19116.44ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 126.0MB in the beginning and 390.8MB in the end (delta: -264.9MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. [2024-10-11 03:04:19,023 INFO L158 Benchmark]: Witness Printer took 94.62ms. Allocated memory is still 427.8MB. Free memory was 390.8MB in the beginning and 386.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:04:19,025 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.16ms. Allocated memory is still 167.8MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.82ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 138.6MB in the end (delta: -42.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 167.8MB. Free memory was 138.5MB in the beginning and 137.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.94ms. Allocated memory is still 167.8MB. Free memory was 137.1MB in the beginning and 138.6MB in the end (delta: -1.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 305.91ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 127.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19116.44ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 126.0MB in the beginning and 390.8MB in the end (delta: -264.9MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. * Witness Printer took 94.62ms. Allocated memory is still 427.8MB. Free memory was 390.8MB in the beginning and 386.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 3596 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3212 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4457 IncrementalHoareTripleChecker+Invalid, 4907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 384 mSDtfsCounter, 4457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2390 GetRequests, 2021 SyntacticMatches, 49 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2807 ConstructedInterpolants, 0 QuantifiedInterpolants, 5639 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2146 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 4947/6663 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: ((((((((2 == \result) && (3 == n)) || ((\result == 1) && (n == 1))) || ((3 == \result) && (n == 4))) || (4 < n)) || (n < 1)) || ((\result == 1) && (2 == n))) && (((\result == 0) || (n == 1)) || (1 < n))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: ((((\result == 0) || (1 < n)) || (n == 1)) && (((((((2 == n) && (\result == 1)) || ((3 == n) && (2 == \result))) || ((n == 1) && (\result == 1))) || (n < 1)) || (5 < n)) || (((n == 4) || (5 == \result)) && (4 <= n)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:04:19,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE