./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i10_o10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i10_o10-1.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 9dc175bed280c85fbc7018a36f57353cd7d8c459346c67f95db055f6ec935a28 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:59:52,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:59:52,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:59:52,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:59:52,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:59:52,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:59:52,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:59:52,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:59:52,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:59:52,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:59:52,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:59:52,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:59:52,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:59:52,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:59:52,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:59:52,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:59:52,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:59:52,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:59:52,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:59:52,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:59:52,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:59:52,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:59:52,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:59:52,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:59:52,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:59:52,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:59:52,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:59:52,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:59:52,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:59:52,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:59:52,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:59:52,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:59:52,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:59:52,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:59:52,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:59:52,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:59:52,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:59:52,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:59:52,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:59:52,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:59:52,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:59:52,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:59:52,187 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 -> 9dc175bed280c85fbc7018a36f57353cd7d8c459346c67f95db055f6ec935a28 [2024-11-11 20:59:52,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:59:52,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:59:52,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:59:52,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:59:52,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:59:52,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i10_o10-1.c [2024-11-11 20:59:53,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:59:54,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:59:54,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i10_o10-1.c [2024-11-11 20:59:54,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bfd2535/c36e95d4f7e84a02869987ddd48370dd/FLAG67b162908 [2024-11-11 20:59:54,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bfd2535/c36e95d4f7e84a02869987ddd48370dd [2024-11-11 20:59:54,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:59:54,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:59:54,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:59:54,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:59:54,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:59:54,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e5ba0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54, skipping insertion in model container [2024-11-11 20:59:54,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:59:54,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i10_o10-1.c[454,467] [2024-11-11 20:59:54,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:59:54,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:59:54,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i10_o10-1.c[454,467] [2024-11-11 20:59:54,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:59:54,263 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:59:54,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54 WrapperNode [2024-11-11 20:59:54,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:59:54,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:59:54,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:59:54,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:59:54,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,292 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-11 20:59:54,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:59:54,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:59:54,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:59:54,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:59:54,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,312 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-11 20:59:54,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:59:54,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:59:54,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:59:54,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:59:54,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (1/1) ... [2024-11-11 20:59:54,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:59:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:54,352 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-11 20:59:54,359 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-11 20:59:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:59:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:59:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:59:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:59:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-11 20:59:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-11 20:59:54,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:59:54,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:59:54,548 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 20:59:54,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:59:54,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:59:54,561 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 20:59:54,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:54 BoogieIcfgContainer [2024-11-11 20:59:54,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:59:54,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:59:54,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:59:54,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:59:54,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:59:54" (1/3) ... [2024-11-11 20:59:54,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ad3bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:59:54, skipping insertion in model container [2024-11-11 20:59:54,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:54" (2/3) ... [2024-11-11 20:59:54,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ad3bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:59:54, skipping insertion in model container [2024-11-11 20:59:54,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:54" (3/3) ... [2024-11-11 20:59:54,569 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2024-11-11 20:59:54,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:59:54,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:59:54,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:59:54,628 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;@7c412355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:59:54,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:59:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:59:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:59:54,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:54,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:54,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:54,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-11 20:59:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909333490] [2024-11-11 20:59:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:54,966 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-11 20:59:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909333490] [2024-11-11 20:59:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909333490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:59:54,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:59:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:59:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545601908] [2024-11-11 20:59:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:59:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:59:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:54,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:59:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:59:55,001 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:59:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:55,044 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-11 20:59:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:59:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-11 20:59:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:55,075 INFO L225 Difference]: With dead ends: 25 [2024-11-11 20:59:55,077 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 20:59:55,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:59:55,095 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:55,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 20:59:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 20:59:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:59:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-11 20:59:55,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-11 20:59:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-11 20:59:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:59:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-11 20:59:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 20:59:55,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:55,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:59:55,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-11 20:59:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153728089] [2024-11-11 20:59:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:55,517 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-11 20:59:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153728089] [2024-11-11 20:59:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153728089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398127033] [2024-11-11 20:59:55,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:55,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:55,521 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-11 20:59:55,523 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-11 20:59:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:59:55,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:55,670 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-11 20:59:55,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:55,907 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-11 20:59:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398127033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:55,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-11 20:59:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175985505] [2024-11-11 20:59:55,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:55,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:59:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:59:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:59:55,911 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 20:59:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:55,977 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-11 20:59:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:59:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2024-11-11 20:59:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:55,979 INFO L225 Difference]: With dead ends: 22 [2024-11-11 20:59:55,980 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 20:59:55,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:59:55,981 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:55,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 20:59:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 20:59:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:59:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-11 20:59:55,989 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-11 20:59:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:55,990 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-11 20:59:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 20:59:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-11 20:59:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 20:59:55,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:55,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:56,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:59:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:56,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-11 20:59:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742675989] [2024-11-11 20:59:56,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:59:56,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742675989] [2024-11-11 20:59:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742675989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017443444] [2024-11-11 20:59:56,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:59:56,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:56,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:56,412 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-11 20:59:56,417 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-11 20:59:56,455 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:59:56,455 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:56,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:59:56,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:59:56,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:59:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017443444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:56,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-11-11 20:59:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917833645] [2024-11-11 20:59:56,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:56,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:59:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:59:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:59:56,917 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 20:59:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:56,974 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-11 20:59:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:59:56,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2024-11-11 20:59:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:56,976 INFO L225 Difference]: With dead ends: 25 [2024-11-11 20:59:56,976 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 20:59:56,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:59:56,978 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:56,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 20:59:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 20:59:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:59:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-11 20:59:56,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-11 20:59:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-11 20:59:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 20:59:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-11 20:59:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:59:56,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:56,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:57,005 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-11 20:59:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 20:59:57,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-11 20:59:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379627125] [2024-11-11 20:59:57,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:59:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379627125] [2024-11-11 20:59:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379627125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901195807] [2024-11-11 20:59:57,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 20:59:57,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:57,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:57,443 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-11 20:59:57,445 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-11 20:59:57,488 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 20:59:57,488 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:57,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 20:59:57,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:59:57,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:59:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901195807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:58,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-11 20:59:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145380094] [2024-11-11 20:59:58,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 20:59:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:58,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 20:59:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-11 20:59:58,082 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:59:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:58,380 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-11 20:59:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 20:59:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2024-11-11 20:59:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:58,382 INFO L225 Difference]: With dead ends: 39 [2024-11-11 20:59:58,382 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 20:59:58,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 20:59:58,384 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:58,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 97 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:59:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 20:59:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 20:59:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:59:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-11 20:59:58,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-11-11 20:59:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-11 20:59:58,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:59:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-11 20:59:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:59:58,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:58,393 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:58,410 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-11 20:59:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:58,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2024-11-11 20:59:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192254266] [2024-11-11 20:59:58,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 20:59:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192254266] [2024-11-11 20:59:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192254266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664223397] [2024-11-11 20:59:59,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 20:59:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:59,202 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-11 20:59:59,203 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-11 20:59:59,245 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 20:59:59,245 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:59,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 20:59:59,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 20:59:59,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 21:00:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664223397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:01,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2024-11-11 21:00:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12751669] [2024-11-11 21:00:01,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:01,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 21:00:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 21:00:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:00:01,729 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-11 21:00:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:01,855 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-11 21:00:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:00:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2024-11-11 21:00:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:01,857 INFO L225 Difference]: With dead ends: 40 [2024-11-11 21:00:01,857 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 21:00:01,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:00:01,858 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:01,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 86 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 21:00:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-11 21:00:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 21:00:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-11 21:00:01,865 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-11 21:00:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:01,866 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-11 21:00:01,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-11 21:00:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-11 21:00:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:00:01,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:01,868 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:01,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:02,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:02,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:02,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2024-11-11 21:00:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056671052] [2024-11-11 21:00:02,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:00:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056671052] [2024-11-11 21:00:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056671052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378947582] [2024-11-11 21:00:02,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:00:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:02,576 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-11 21:00:02,577 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-11 21:00:02,658 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-11 21:00:02,659 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:02,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:00:02,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 21:00:02,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 21:00:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378947582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:05,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 37 [2024-11-11 21:00:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018481527] [2024-11-11 21:00:05,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:05,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:00:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:00:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:00:05,303 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 26 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:00:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:05,630 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-11 21:00:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 21:00:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 26 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) Word has length 58 [2024-11-11 21:00:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:05,632 INFO L225 Difference]: With dead ends: 48 [2024-11-11 21:00:05,632 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 21:00:05,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 94 SyntacticMatches, 15 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=2778, Unknown=0, NotChecked=0, Total=3306 [2024-11-11 21:00:05,638 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:05,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 101 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 21:00:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 21:00:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:00:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-11 21:00:05,654 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 58 [2024-11-11 21:00:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:05,655 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-11 21:00:05,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 26 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:00:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-11 21:00:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:00:05,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:05,659 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:05,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:05,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:05,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:05,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 6 times [2024-11-11 21:00:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718915161] [2024-11-11 21:00:05,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:00:05,873 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 21:00:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:00:05,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 21:00:05,907 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 21:00:05,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:00:05,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:00:05,914 INFO L421 BasicCegarLoop]: Path program histogram: [6, 1] [2024-11-11 21:00:05,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:00:05,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:00:05 BoogieIcfgContainer [2024-11-11 21:00:05,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:00:05,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:00:05,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:00:05,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:00:05,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:54" (3/4) ... [2024-11-11 21:00:05,951 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 21:00:05,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:00:05,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:00:05,998 INFO L158 Benchmark]: Toolchain (without parser) took 11956.62ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 123.6MB in the beginning and 110.9MB in the end (delta: 12.6MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2024-11-11 21:00:05,998 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:00:05,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.23ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 111.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:00:05,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.58ms. Allocated memory is still 155.2MB. Free memory was 111.6MB in the beginning and 110.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:05,999 INFO L158 Benchmark]: Boogie Preprocessor took 29.29ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 108.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:06,000 INFO L158 Benchmark]: RCFGBuilder took 237.85ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 99.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 21:00:06,000 INFO L158 Benchmark]: TraceAbstraction took 11385.93ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 98.4MB in the beginning and 113.0MB in the end (delta: -14.6MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:06,000 INFO L158 Benchmark]: Witness Printer took 47.79ms. Allocated memory is still 224.4MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:06,002 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.12ms. Allocated memory is still 121.6MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.23ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 111.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.58ms. Allocated memory is still 155.2MB. Free memory was 111.6MB in the beginning and 110.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.29ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 108.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 237.85ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 99.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11385.93ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 98.4MB in the beginning and 113.0MB in the end (delta: -14.6MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 47.79ms. Allocated memory is still 224.4MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 10; VAL [input=10] [L13] CALL, EXPR id(input) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=10] [L13] int result = id(input); [L14] COND TRUE result == 10 VAL [input=10] [L15] reach_error() VAL [input=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 66 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 307 SyntacticMatches, 28 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 74, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 432 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 10 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 528/1206 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-11 21:00:06,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE