./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:20:49,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:20:50,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:20:50,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:20:50,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:20:50,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:20:50,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:20:50,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:20:50,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:20:50,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:20:50,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:20:50,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:20:50,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:20:50,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:20:50,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:20:50,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:20:50,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:20:50,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:20:50,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:20:50,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:20:50,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:20:50,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:20:50,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:20:50,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:20:50,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:20:50,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:20:50,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:20:50,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:20:50,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:20:50,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:20:50,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:20:50,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:20:50,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:50,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:20:50,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:20:50,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:20:50,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:20:50,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:20:50,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:20:50,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:20:50,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:20:50,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:20:50,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2024-11-08 15:20:50,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:20:50,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:20:50,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:20:50,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:20:50,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:20:50,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2024-11-08 15:20:51,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:20:51,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:20:51,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2024-11-08 15:20:51,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee4f4bca/4a7e005ff53f461f901cde5e553f9e15/FLAGcb9c868c8 [2024-11-08 15:20:51,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee4f4bca/4a7e005ff53f461f901cde5e553f9e15 [2024-11-08 15:20:51,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:20:51,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:20:51,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:51,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:20:51,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:20:51,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:51" (1/1) ... [2024-11-08 15:20:51,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174144f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:51, skipping insertion in model container [2024-11-08 15:20:51,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:51" (1/1) ... [2024-11-08 15:20:51,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:20:52,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c[454,467] [2024-11-08 15:20:52,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:52,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:20:52,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c[454,467] [2024-11-08 15:20:52,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:52,189 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:20:52,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52 WrapperNode [2024-11-08 15:20:52,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:52,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:52,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:20:52,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:20:52,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,223 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-08 15:20:52,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:52,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:20:52,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:20:52,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:20:52,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:20:52,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:20:52,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:20:52,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:20:52,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:20:52,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (1/1) ... [2024-11-08 15:20:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:52,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:20:52,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:20:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:20:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:20:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:20:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:20:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-08 15:20:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-08 15:20:52,402 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:20:52,403 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:20:52,472 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 15:20:52,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:20:52,481 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:20:52,481 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:20:52,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:52 BoogieIcfgContainer [2024-11-08 15:20:52,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:20:52,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:20:52,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:20:52,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:20:52,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:20:51" (1/3) ... [2024-11-08 15:20:52,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a12a53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:52, skipping insertion in model container [2024-11-08 15:20:52,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:52" (2/3) ... [2024-11-08 15:20:52,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a12a53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:52, skipping insertion in model container [2024-11-08 15:20:52,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:52" (3/3) ... [2024-11-08 15:20:52,489 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2024-11-08 15:20:52,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:20:52,504 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:20:52,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:20:52,570 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;@1aecdbad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:20:52,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:20:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:20:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:20:52,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:52,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:52,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:52,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-08 15:20:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928266843] [2024-11-08 15:20:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:20:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:52,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928266843] [2024-11-08 15:20:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928266843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528994912] [2024-11-08 15:20:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:52,974 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:20:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:53,025 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 15:20:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-08 15:20:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:53,033 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:20:53,034 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:20:53,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:53,041 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:53,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:20:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:20:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:20:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:20:53,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-08 15:20:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:20:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:20:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:20:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:20:53,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:53,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:53,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:20:53,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-08 15:20:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904117573] [2024-11-08 15:20:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:20:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904117573] [2024-11-08 15:20:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904117573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798853565] [2024-11-08 15:20:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:53,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:53,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:53,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:20:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:53,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:53,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:20:53,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:20:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798853565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:53,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-08 15:20:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020863350] [2024-11-08 15:20:53,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:53,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:20:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:20:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:20:53,717 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:20:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:53,778 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 15:20:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:20:53,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2024-11-08 15:20:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:53,780 INFO L225 Difference]: With dead ends: 22 [2024-11-08 15:20:53,781 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 15:20:53,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:53,784 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:53,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 15:20:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 15:20:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:20:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 15:20:53,792 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-08 15:20:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:53,792 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 15:20:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:20:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 15:20:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:20:53,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:53,795 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:53,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:20:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:53,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-08 15:20:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305920093] [2024-11-08 15:20:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:20:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305920093] [2024-11-08 15:20:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305920093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811939293] [2024-11-08 15:20:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:54,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:54,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:20:54,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:54,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:54,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:54,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:20:54,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:20:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811939293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:54,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-11-08 15:20:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971411447] [2024-11-08 15:20:54,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:20:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:20:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:20:54,728 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-08 15:20:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:54,792 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:20:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:20:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2024-11-08 15:20:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:54,794 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:20:54,794 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:20:54,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:20:54,796 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:54,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:20:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:20:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:20:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-08 15:20:54,802 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-08 15:20:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:54,802 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-08 15:20:54,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-08 15:20:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-08 15:20:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:20:54,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:54,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:54,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:55,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 15:20:55,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:55,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-08 15:20:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134380713] [2024-11-08 15:20:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:20:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134380713] [2024-11-08 15:20:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134380713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748879437] [2024-11-08 15:20:55,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:55,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:55,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:20:55,303 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:20:55,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:55,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:55,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:20:55,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:20:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748879437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:55,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:55,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-08 15:20:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797707067] [2024-11-08 15:20:55,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:55,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 15:20:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 15:20:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-08 15:20:55,874 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 15:20:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:56,166 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-08 15:20:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:20:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2024-11-08 15:20:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:56,168 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:20:56,168 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 15:20:56,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 15:20:56,170 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:56,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 97 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 15:20:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 15:20:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 15:20:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 15:20:56,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-11-08 15:20:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:56,183 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 15:20:56,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 15:20:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 15:20:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:20:56,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:56,186 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:56,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:56,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:56,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2024-11-08 15:20:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:56,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744949525] [2024-11-08 15:20:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 15:20:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744949525] [2024-11-08 15:20:56,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744949525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321190104] [2024-11-08 15:20:56,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:20:56,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:56,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:56,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:20:56,914 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:20:56,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:56,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:20:56,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:20:57,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 15:20:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321190104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:59,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2024-11-08 15:20:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065345578] [2024-11-08 15:20:59,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:20:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:20:59,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:20:59,346 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-08 15:20:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:59,458 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-08 15:20:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:20:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2024-11-08 15:20:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:59,459 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:20:59,460 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:20:59,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2024-11-08 15:20:59,462 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:59,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 86 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:20:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:20:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 15:20:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:20:59,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-08 15:20:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:20:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-08 15:20:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:20:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:20:59,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:59,471 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:59,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:20:59,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:59,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2024-11-08 15:20:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597730971] [2024-11-08 15:20:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:21:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597730971] [2024-11-08 15:21:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597730971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151711406] [2024-11-08 15:21:00,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:00,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:00,208 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:00,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:21:00,293 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-08 15:21:00,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:00,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 15:21:00,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:00,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151711406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:02,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:02,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 52 [2024-11-08 15:21:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573045873] [2024-11-08 15:21:02,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:02,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 15:21:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 15:21:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 15:21:02,984 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-08 15:21:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:03,555 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-08 15:21:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 15:21:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2024-11-08 15:21:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:03,559 INFO L225 Difference]: With dead ends: 69 [2024-11-08 15:21:03,559 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 15:21:03,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1172, Invalid=6310, Unknown=0, NotChecked=0, Total=7482 [2024-11-08 15:21:03,562 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:03,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 123 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 15:21:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 15:21:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 15:21:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2024-11-08 15:21:03,575 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2024-11-08 15:21:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2024-11-08 15:21:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-08 15:21:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2024-11-08 15:21:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 15:21:03,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:03,578 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:03,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:21:03,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:03,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:03,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2024-11-08 15:21:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149221834] [2024-11-08 15:21:03,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-11-08 15:21:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149221834] [2024-11-08 15:21:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149221834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257579501] [2024-11-08 15:21:06,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:06,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:06,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:21:06,331 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-11-08 15:21:06,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:06,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 15:21:06,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-08 15:21:07,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-08 15:21:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257579501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:26,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 39, 39] total 76 [2024-11-08 15:21:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20921005] [2024-11-08 15:21:26,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:26,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-08 15:21:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-08 15:21:26,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=4818, Unknown=0, NotChecked=0, Total=5700 [2024-11-08 15:21:26,734 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-08 15:21:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:27,996 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-08 15:21:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 15:21:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2024-11-08 15:21:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:27,999 INFO L225 Difference]: With dead ends: 93 [2024-11-08 15:21:27,999 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 15:21:28,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 184 SyntacticMatches, 21 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5005 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2586, Invalid=13416, Unknown=0, NotChecked=0, Total=16002 [2024-11-08 15:21:28,005 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:28,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 175 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 15:21:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 15:21:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 15:21:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-08 15:21:28,017 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2024-11-08 15:21:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:28,018 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-08 15:21:28,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-08 15:21:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-08 15:21:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 15:21:28,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:28,021 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:28,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:28,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:28,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 7 times [2024-11-08 15:21:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937625905] [2024-11-08 15:21:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:21:28,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:21:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:21:28,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:21:28,331 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:21:28,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:21:28,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:21:28,336 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1] [2024-11-08 15:21:28,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:21:28,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:21:28 BoogieIcfgContainer [2024-11-08 15:21:28,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:21:28,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:21:28,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:21:28,399 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:21:28,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:52" (3/4) ... [2024-11-08 15:21:28,401 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:21:28,468 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:21:28,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:21:28,468 INFO L158 Benchmark]: Toolchain (without parser) took 36517.39ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 88.6MB in the beginning and 111.6MB in the end (delta: -23.1MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,469 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 103.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:21:28,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.22ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 75.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.25ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 74.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,469 INFO L158 Benchmark]: Boogie Preprocessor took 36.92ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,470 INFO L158 Benchmark]: RCFGBuilder took 218.23ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 63.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,470 INFO L158 Benchmark]: TraceAbstraction took 35914.24ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 62.8MB in the beginning and 115.8MB in the end (delta: -53.0MB). Peak memory consumption was 150.4MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,470 INFO L158 Benchmark]: Witness Printer took 69.69ms. Allocated memory is still 343.9MB. Free memory was 115.8MB in the beginning and 111.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:21:28,473 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 103.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.22ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 75.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.25ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 74.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.92ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.23ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 63.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35914.24ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 62.8MB in the beginning and 115.8MB in the end (delta: -53.0MB). Peak memory consumption was 150.4MB. Max. memory is 16.1GB. * Witness Printer took 69.69ms. Allocated memory is still 343.9MB. Free memory was 115.8MB in the beginning and 111.6MB 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25] [L15] reach_error() VAL [input=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 623 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 75 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 832 GetRequests, 491 SyntacticMatches, 34 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7631 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2039 SizeOfPredicates, 10 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1837/3858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:21:28,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE