./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-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/id2_i5_o5-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 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:20:36,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:20:36,565 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:36,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:20:36,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:20:36,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:20:36,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:20:36,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:20:36,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:20:36,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:20:36,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:20:36,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:20:36,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:20:36,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:20:36,604 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:20:36,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:20:36,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:20:36,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:20:36,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:20:36,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:20:36,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:20:36,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:20:36,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:20:36,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:20:36,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:20:36,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:20:36,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:20:36,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:20:36,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:20:36,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:20:36,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:20:36,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:20:36,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:36,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:20:36,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:20:36,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:20:36,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:20:36,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:20:36,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:20:36,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:20:36,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:20:36,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:20:36,611 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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 [2024-11-08 15:20:36,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:20:36,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:20:36,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:20:36,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:20:36,843 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:20:36,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-11-08 15:20:38,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:20:38,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:20:38,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-11-08 15:20:38,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bedf956/b9859e6ad0fb4e1ebf30a8d7b76c8633/FLAGb8a4e908f [2024-11-08 15:20:38,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bedf956/b9859e6ad0fb4e1ebf30a8d7b76c8633 [2024-11-08 15:20:38,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:20:38,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:20:38,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:38,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:20:38,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:20:38,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:38" (1/1) ... [2024-11-08 15:20:38,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a87677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:38, skipping insertion in model container [2024-11-08 15:20:38,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:38" (1/1) ... [2024-11-08 15:20:38,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:20:38,899 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/id2_i5_o5-2.c[548,561] [2024-11-08 15:20:38,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:38,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:20:38,921 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/id2_i5_o5-2.c[548,561] [2024-11-08 15:20:38,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:38,935 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:20:38,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:38 WrapperNode [2024-11-08 15:20:38,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:38,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:38,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:20:38,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:20:38,943 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:38" (1/1) ... [2024-11-08 15:20:38,948 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:38" (1/1) ... [2024-11-08 15:20:38,961 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-08 15:20:38,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:38,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:20:38,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:20:38,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:20:38,970 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:38" (1/1) ... [2024-11-08 15:20:38,971 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:38" (1/1) ... [2024-11-08 15:20:38,974 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:38" (1/1) ... [2024-11-08 15:20:38,983 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:38,983 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:38" (1/1) ... [2024-11-08 15:20:38,983 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:38" (1/1) ... [2024-11-08 15:20:38,985 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:38" (1/1) ... [2024-11-08 15:20:38,987 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:38" (1/1) ... [2024-11-08 15:20:38,991 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:38" (1/1) ... [2024-11-08 15:20:38,992 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:38" (1/1) ... [2024-11-08 15:20:38,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:20:38,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:20:38,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:20:38,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:20:38,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:38" (1/1) ... [2024-11-08 15:20:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:39,027 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:39,030 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:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:20:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:20:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-11-08 15:20:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-11-08 15:20:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:20:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:20:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-08 15:20:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-08 15:20:39,133 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:20:39,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:20:39,252 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-08 15:20:39,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:20:39,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:20:39,267 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:20:39,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:39 BoogieIcfgContainer [2024-11-08 15:20:39,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:20:39,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:20:39,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:20:39,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:20:39,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:20:38" (1/3) ... [2024-11-08 15:20:39,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342d98d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:39, skipping insertion in model container [2024-11-08 15:20:39,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:38" (2/3) ... [2024-11-08 15:20:39,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342d98d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:39, skipping insertion in model container [2024-11-08 15:20:39,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:39" (3/3) ... [2024-11-08 15:20:39,276 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2024-11-08 15:20:39,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:20:39,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:20:39,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:20:39,353 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;@1a37e949, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:20:39,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:20:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:20:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:20:39,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:39,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:39,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -214835512, now seen corresponding path program 1 times [2024-11-08 15:20:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538459409] [2024-11-08 15:20:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:39,674 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:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538459409] [2024-11-08 15:20:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538459409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:39,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:39,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514330837] [2024-11-08 15:20:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:39,704 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:39,757 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-08 15:20:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:39,765 INFO L225 Difference]: With dead ends: 31 [2024-11-08 15:20:39,766 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:20:39,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:39,770 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:39,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:20:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:20:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:20:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-08 15:20:39,798 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2024-11-08 15:20:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:39,798 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-08 15:20:39,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-08 15:20:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:20:39,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:39,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:39,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:20:39,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1901198062, now seen corresponding path program 1 times [2024-11-08 15:20:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151709464] [2024-11-08 15:20:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,019 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:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151709464] [2024-11-08 15:20:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151709464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:40,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:40,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:20:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880032450] [2024-11-08 15:20:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:40,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:20:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:20:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:20:40,023 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:20:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:40,085 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-08 15:20:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:20:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-08 15:20:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:40,087 INFO L225 Difference]: With dead ends: 30 [2024-11-08 15:20:40,087 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 15:20:40,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:20:40,088 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:40,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 15:20:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-08 15:20:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 15:20:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-08 15:20:40,098 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2024-11-08 15:20:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:40,098 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-08 15:20:40,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:20:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-08 15:20:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:20:40,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:40,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:40,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:20:40,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:40,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1593669520, now seen corresponding path program 1 times [2024-11-08 15:20:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128274149] [2024-11-08 15:20:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,334 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:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128274149] [2024-11-08 15:20:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128274149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674608468] [2024-11-08 15:20:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:40,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:40,337 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:40,338 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:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:40,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:40,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:40,489 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:40,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:40,841 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:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674608468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:40,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-11-08 15:20:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269966603] [2024-11-08 15:20:40,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:20:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:20:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:20:40,849 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:20:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:40,942 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-08 15:20:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:20:40,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-11-08 15:20:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:40,944 INFO L225 Difference]: With dead ends: 36 [2024-11-08 15:20:40,944 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 15:20:40,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:20:40,945 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:40,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 108 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 15:20:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-08 15:20:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 15:20:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-08 15:20:40,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2024-11-08 15:20:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-08 15:20:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:20:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-08 15:20:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:20:40,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:40,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:40,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:41,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:41,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:41,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash 545848374, now seen corresponding path program 1 times [2024-11-08 15:20:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464327000] [2024-11-08 15:20:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:20:41,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:41,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464327000] [2024-11-08 15:20:41,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464327000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:41,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635189523] [2024-11-08 15:20:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:41,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:41,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:41,372 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:41,375 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:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:41,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:41,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:20:41,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:20:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635189523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:41,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2024-11-08 15:20:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754915478] [2024-11-08 15:20:41,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:20:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:20:41,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:20:41,965 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 15:20:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:42,066 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-08 15:20:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:20:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) Word has length 28 [2024-11-08 15:20:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:42,067 INFO L225 Difference]: With dead ends: 42 [2024-11-08 15:20:42,067 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 15:20:42,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:20:42,068 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:42,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 15:20:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-11-08 15:20:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 15:20:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-08 15:20:42,072 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2024-11-08 15:20:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:42,072 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-08 15:20:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 15:20:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-08 15:20:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:20:42,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:42,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:42,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:20:42,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 15:20:42,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:42,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 120771672, now seen corresponding path program 2 times [2024-11-08 15:20:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546073258] [2024-11-08 15:20:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:20:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546073258] [2024-11-08 15:20:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546073258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511164029] [2024-11-08 15:20:42,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:42,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:42,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:42,518 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:42,519 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:42,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:42,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:42,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:20:42,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:20:42,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:20:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511164029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:43,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 19 [2024-11-08 15:20:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405984176] [2024-11-08 15:20:43,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 15:20:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 15:20:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:20:43,216 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-08 15:20:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:43,319 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-08 15:20:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:20:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) Word has length 34 [2024-11-08 15:20:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:43,321 INFO L225 Difference]: With dead ends: 48 [2024-11-08 15:20:43,321 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 15:20:43,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:20:43,322 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:43,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 137 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 15:20:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2024-11-08 15:20:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:20:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-08 15:20:43,332 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 34 [2024-11-08 15:20:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:43,332 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-08 15:20:43,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-08 15:20:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-08 15:20:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:20:43,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:43,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:43,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:20:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:43,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:43,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash -644488834, now seen corresponding path program 2 times [2024-11-08 15:20:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384416011] [2024-11-08 15:20:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 15:20:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384416011] [2024-11-08 15:20:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384416011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:43,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2580878] [2024-11-08 15:20:43,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:43,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:43,806 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:43,810 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:43,858 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:43,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:43,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 15:20:43,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 15:20:43,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 15:20:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2580878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:44,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-11-08 15:20:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76998992] [2024-11-08 15:20:44,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:44,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:20:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:20:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:44,028 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:20:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:44,089 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-08 15:20:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:20:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2024-11-08 15:20:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:44,090 INFO L225 Difference]: With dead ends: 54 [2024-11-08 15:20:44,091 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 15:20:44,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:44,092 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:44,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 15:20:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2024-11-08 15:20:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:20:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-08 15:20:44,099 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 40 [2024-11-08 15:20:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:44,100 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-08 15:20:44,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:20:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-08 15:20:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:20:44,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:44,101 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:44,113 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:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:44,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1812460832, now seen corresponding path program 3 times [2024-11-08 15:20:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094968527] [2024-11-08 15:20:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 15:20:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094968527] [2024-11-08 15:20:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094968527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714037865] [2024-11-08 15:20:44,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:44,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:44,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:44,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:44,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:20:44,644 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:20:44,644 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:44,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:20:44,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:20:44,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:20:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714037865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:44,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:20:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 16 [2024-11-08 15:20:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006117820] [2024-11-08 15:20:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:20:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:44,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:20:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:20:44,710 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 15:20:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:44,807 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-08 15:20:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:20:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-11-08 15:20:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:44,808 INFO L225 Difference]: With dead ends: 60 [2024-11-08 15:20:44,809 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:20:44,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:20:44,810 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:44,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:20:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:20:44,814 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), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:20:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:20:44,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 46 [2024-11-08 15:20:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:44,815 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:20:44,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 15:20:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:20:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:20:44,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:44,816 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:44,829 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:20:45,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:45,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:45,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash -866735418, now seen corresponding path program 3 times [2024-11-08 15:20:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324708028] [2024-11-08 15:20:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 15:20:45,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:45,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324708028] [2024-11-08 15:20:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324708028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426506222] [2024-11-08 15:20:45,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:45,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:45,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:20:45,348 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:20:45,348 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:45,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:20:45,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 15:20:45,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:20:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426506222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:20:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 17 [2024-11-08 15:20:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027668721] [2024-11-08 15:20:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:45,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:45,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:20:45,425 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:20:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:45,543 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-08 15:20:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:20:45,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 52 [2024-11-08 15:20:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:45,545 INFO L225 Difference]: With dead ends: 36 [2024-11-08 15:20:45,545 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:20:45,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:20:45,546 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:45,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 156 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:20:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:20:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:20:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:20:45,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-08 15:20:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:45,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:20:45,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:20:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:20:45,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:20:45,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:20:45,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:20:45,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:45,756 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2024-11-08 15:20:45,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:20:46,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:20:46,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:20:46 BoogieIcfgContainer [2024-11-08 15:20:46,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:20:46,134 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:20:46,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:20:46,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:20:46,135 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:39" (3/4) ... [2024-11-08 15:20:46,138 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:20:46,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2024-11-08 15:20:46,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-11-08 15:20:46,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 15:20:46,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 15:20:46,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:20:46,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:20:46,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:20:46,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:20:46,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:20:46,210 INFO L158 Benchmark]: Toolchain (without parser) took 7498.33ms. Allocated memory was 130.0MB in the beginning and 213.9MB in the end (delta: 83.9MB). Free memory was 84.1MB in the beginning and 87.7MB in the end (delta: -3.6MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,210 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:46,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.34ms. Allocated memory is still 130.0MB. Free memory was 84.1MB in the beginning and 71.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.48ms. Allocated memory is still 130.0MB. Free memory was 71.1MB in the beginning and 69.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:46,211 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 130.0MB. Free memory was 69.7MB in the beginning and 68.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,211 INFO L158 Benchmark]: RCFGBuilder took 274.06ms. Allocated memory is still 130.0MB. Free memory was 68.1MB in the beginning and 58.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,211 INFO L158 Benchmark]: TraceAbstraction took 6863.61ms. Allocated memory was 130.0MB in the beginning and 213.9MB in the end (delta: 83.9MB). Free memory was 57.6MB in the beginning and 91.9MB in the end (delta: -34.3MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,212 INFO L158 Benchmark]: Witness Printer took 75.77ms. Allocated memory is still 213.9MB. Free memory was 91.9MB in the beginning and 87.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:20:46,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.34ms. Allocated memory is still 130.0MB. Free memory was 84.1MB in the beginning and 71.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.48ms. Allocated memory is still 130.0MB. Free memory was 71.1MB in the beginning and 69.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 130.0MB. Free memory was 69.7MB in the beginning and 68.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.06ms. Allocated memory is still 130.0MB. Free memory was 68.1MB in the beginning and 58.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6863.61ms. Allocated memory was 130.0MB in the beginning and 213.9MB in the end (delta: 83.9MB). Free memory was 57.6MB in the beginning and 91.9MB in the end (delta: -34.3MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 75.77ms. Allocated memory is still 213.9MB. Free memory was 91.9MB in the beginning and 87.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 1215 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1051 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 164 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 364 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 83, 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, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 470 NumberOfCodeBlocks, 470 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 1458 SizeOfPredicates, 22 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 295/426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2. Ensures: ((((((x == 0) && (\result == 0)) || (x == 1)) || (((\result == 2) && (x <= 3)) && (2 <= x))) || (4 < x)) || (((3 == x) || (\result == 4)) && (3 <= x))) - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((x == 0) || (x == 4)) || ((5 == \result) && (5 == x))) || ((((3 == \result) && (x <= 4)) || (x == 2)) && (2 <= x))) || (((\result == 1) && (x <= 2)) && (1 <= x))) || (5 < x)) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:20:46,247 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 Result: TRUE