./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:22:37,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:22:37,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:22:37,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:22:37,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:22:37,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:22:37,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:22:37,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:22:37,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:22:37,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:22:37,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:22:37,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:22:37,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:22:37,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:22:37,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:22:37,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:22:37,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:22:37,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:22:37,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:22:37,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:22:37,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:22:37,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:22:37,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:22:37,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:22:37,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:22:37,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:22:37,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:22:37,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:22:37,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:22:37,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:22:37,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:22:37,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:22:37,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:22:37,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:22:37,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:22:37,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:22:37,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:22:37,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:22:37,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:22:37,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:22:37,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:22:37,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:22:37,547 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-09 23:22:37,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:22:37,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:22:37,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:22:37,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:22:37,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:22:37,789 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-09 23:22:39,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:22:39,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:22:39,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i10_o10-1.c [2024-11-09 23:22:39,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15c55e5f/734c60bcce96468698b3b06a278c1f9c/FLAGcdc1ed9c6 [2024-11-09 23:22:39,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15c55e5f/734c60bcce96468698b3b06a278c1f9c [2024-11-09 23:22:39,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:22:39,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:22:39,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:39,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:22:39,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:22:39,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c17be1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39, skipping insertion in model container [2024-11-09 23:22:39,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:22:39,885 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-09 23:22:39,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:39,900 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:22:39,911 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-09 23:22:39,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:39,925 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:22:39,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39 WrapperNode [2024-11-09 23:22:39,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:39,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:39,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:22:39,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:22:39,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,948 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-09 23:22:39,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:39,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:22:39,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:22:39,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:22:39,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,967 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-09 23:22:39,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:22:39,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:22:39,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:22:39,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:22:39,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (1/1) ... [2024-11-09 23:22:39,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:22:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:40,018 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-09 23:22:40,025 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-09 23:22:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:22:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:22:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:22:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:22:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-09 23:22:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-09 23:22:40,134 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:22:40,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:22:40,234 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2024-11-09 23:22:40,241 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-09 23:22:40,242 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:22:40,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:22:40,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:22:40,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:40 BoogieIcfgContainer [2024-11-09 23:22:40,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:22:40,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:22:40,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:22:40,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:22:40,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:22:39" (1/3) ... [2024-11-09 23:22:40,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162a9dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:40, skipping insertion in model container [2024-11-09 23:22:40,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:39" (2/3) ... [2024-11-09 23:22:40,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162a9dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:40, skipping insertion in model container [2024-11-09 23:22:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:40" (3/3) ... [2024-11-09 23:22:40,268 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2024-11-09 23:22:40,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:22:40,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:22:40,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:22:40,373 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;@1c7190b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:22:40,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:22:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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-09 23:22:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:22:40,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:40,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:40,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1886413104, now seen corresponding path program 1 times [2024-11-09 23:22:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:40,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068993717] [2024-11-09 23:22:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:40,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:40,643 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-09 23:22:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068993717] [2024-11-09 23:22:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068993717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:22:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:22:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:22:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956485800] [2024-11-09 23:22:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:22:40,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:22:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:22:40,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:40,681 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:40,731 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-09 23:22:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:22:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 23:22:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:40,743 INFO L225 Difference]: With dead ends: 28 [2024-11-09 23:22:40,743 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 23:22:40,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:40,754 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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-09 23:22:40,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 23:22:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 23:22:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 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-09 23:22:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-09 23:22:40,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-09 23:22:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:40,799 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-09 23:22:40,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-09 23:22:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 23:22:40,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:40,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:40,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:22:40,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:40,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1799886983, now seen corresponding path program 1 times [2024-11-09 23:22:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923256112] [2024-11-09 23:22:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,148 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-09 23:22:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923256112] [2024-11-09 23:22:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923256112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941664913] [2024-11-09 23:22:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:41,153 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-09 23:22:41,154 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-09 23:22:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:22:41,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:41,285 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-09 23:22:41,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:41,492 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-09 23:22:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941664913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:41,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-09 23:22:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228048490] [2024-11-09 23:22:41,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:22:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:22:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:22:41,499 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 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-09 23:22:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:41,559 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-09 23:22:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:22:41,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 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 17 [2024-11-09 23:22:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:41,561 INFO L225 Difference]: With dead ends: 24 [2024-11-09 23:22:41,561 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 23:22:41,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 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-09 23:22:41,563 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:41,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 23:22:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 23:22:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 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-09 23:22:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-09 23:22:41,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2024-11-09 23:22:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:41,569 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-09 23:22:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 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-09 23:22:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-09 23:22:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 23:22:41,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:41,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:41,588 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-09 23:22:41,773 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-09 23:22:41,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1665660048, now seen corresponding path program 2 times [2024-11-09 23:22:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048264734] [2024-11-09 23:22:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:42,037 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-09 23:22:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:42,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048264734] [2024-11-09 23:22:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048264734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690239876] [2024-11-09 23:22:42,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:22:42,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:42,040 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-09 23:22:42,042 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-09 23:22:42,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:22:42,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:42,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:22:42,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:42,147 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-09 23:22:42,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:42,489 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-09 23:22:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690239876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:42,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-11-09 23:22:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039385527] [2024-11-09 23:22:42,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 23:22:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 23:22:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:22:42,492 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 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-09 23:22:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:42,548 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-09 23:22:42,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:22:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 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 23 [2024-11-09 23:22:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:42,551 INFO L225 Difference]: With dead ends: 27 [2024-11-09 23:22:42,551 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 23:22:42,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 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-09 23:22:42,553 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:42,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 23:22:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 23:22:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 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-09 23:22:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-09 23:22:42,561 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 23 [2024-11-09 23:22:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:42,561 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-09 23:22:42,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 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-09 23:22:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-09 23:22:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:22:42,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:42,563 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:42,581 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-09 23:22:42,763 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-09 23:22:42,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1892917223, now seen corresponding path program 3 times [2024-11-09 23:22:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350751033] [2024-11-09 23:22:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:43,022 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-09 23:22:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350751033] [2024-11-09 23:22:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350751033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308545176] [2024-11-09 23:22:43,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:22:43,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:43,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:43,027 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-09 23:22:43,029 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-09 23:22:43,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 23:22:43,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:43,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:22:43,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:43,204 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-09 23:22:43,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:43,638 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-09 23:22:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308545176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:43,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-09 23:22:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784987591] [2024-11-09 23:22:43,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 23:22:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 23:22:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:22:43,642 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 19 states have internal predecessors, (40), 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-09 23:22:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:43,927 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-09 23:22:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:22:43,928 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 19 states have internal predecessors, (40), 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 29 [2024-11-09 23:22:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:43,929 INFO L225 Difference]: With dead ends: 41 [2024-11-09 23:22:43,930 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 23:22:43,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 23:22:43,933 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:43,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 23:22:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 23:22:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 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-09 23:22:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-09 23:22:43,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2024-11-09 23:22:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:43,949 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-09 23:22:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 19 states have internal predecessors, (40), 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-09 23:22:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-09 23:22:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:22:43,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:43,950 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:43,966 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-09 23:22:44,154 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-09 23:22:44,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1254058329, now seen corresponding path program 4 times [2024-11-09 23:22:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663501427] [2024-11-09 23:22:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:44,675 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-09 23:22:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663501427] [2024-11-09 23:22:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663501427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341140588] [2024-11-09 23:22:44,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:22:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:44,678 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-09 23:22:44,680 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-09 23:22:44,731 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:22:44,731 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:44,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:22:44,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:44,830 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-09 23:22:44,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:47,107 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-09 23:22:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341140588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:47,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2024-11-09 23:22:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623835480] [2024-11-09 23:22:47,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:22:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:22:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:22:47,113 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 24 states have internal predecessors, (46), 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-09 23:22:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:47,204 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-09 23:22:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:22:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 24 states have internal predecessors, (46), 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 53 [2024-11-09 23:22:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:47,206 INFO L225 Difference]: With dead ends: 42 [2024-11-09 23:22:47,208 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 23:22:47,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 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-09 23:22:47,210 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:47,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 98 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 23:22:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 23:22:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 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-09 23:22:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-09 23:22:47,220 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 53 [2024-11-09 23:22:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:47,221 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-09 23:22:47,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 24 states have internal predecessors, (46), 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-09 23:22:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-09 23:22:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:22:47,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:47,223 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:47,236 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-09 23:22:47,423 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-09 23:22:47,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:47,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1330872656, now seen corresponding path program 5 times [2024-11-09 23:22:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:47,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42012542] [2024-11-09 23:22:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:47,988 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-09 23:22:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42012542] [2024-11-09 23:22:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42012542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73860567] [2024-11-09 23:22:47,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:22:47,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:47,991 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-09 23:22:47,993 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-09 23:22:48,077 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-09 23:22:48,077 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:48,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 23:22:48,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:48,368 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-09 23:22:48,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:50,665 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-09 23:22:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73860567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:50,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 37 [2024-11-09 23:22:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365670798] [2024-11-09 23:22:50,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 23:22:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 23:22:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 23:22:50,670 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 26 states have internal predecessors, (55), 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-09 23:22:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:51,022 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-09 23:22:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 23:22:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 26 states have internal predecessors, (55), 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 59 [2024-11-09 23:22:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:51,025 INFO L225 Difference]: With dead ends: 50 [2024-11-09 23:22:51,025 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 23:22:51,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 96 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-09 23:22:51,029 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:51,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 137 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 23:22:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 23:22:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 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-09 23:22:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-11-09 23:22:51,043 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 59 [2024-11-09 23:22:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:51,044 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-11-09 23:22:51,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 26 states have internal predecessors, (55), 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-09 23:22:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-11-09 23:22:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:22:51,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:51,045 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:51,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:22:51,246 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-09 23:22:51,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:51,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -325841424, now seen corresponding path program 6 times [2024-11-09 23:22:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947422599] [2024-11-09 23:22:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:51,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:22:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:51,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:22:51,292 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:22:51,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:22:51,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:22:51,297 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1] [2024-11-09 23:22:51,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:22:51,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:22:51 BoogieIcfgContainer [2024-11-09 23:22:51,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:22:51,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:22:51,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:22:51,324 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:22:51,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:40" (3/4) ... [2024-11-09 23:22:51,326 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:22:51,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:22:51,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:22:51,376 INFO L158 Benchmark]: Toolchain (without parser) took 11665.20ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 84.3MB in the beginning and 185.3MB in the end (delta: -101.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-09 23:22:51,376 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 155.2MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:51,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 72.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:22:51,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.44ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:22:51,377 INFO L158 Benchmark]: Boogie Preprocessor took 23.10ms. Allocated memory is still 155.2MB. Free memory was 70.7MB in the beginning and 69.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:51,377 INFO L158 Benchmark]: IcfgBuilder took 284.19ms. Allocated memory is still 155.2MB. Free memory was 69.2MB in the beginning and 59.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 23:22:51,378 INFO L158 Benchmark]: TraceAbstraction took 11063.52ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 58.3MB in the beginning and 187.4MB in the end (delta: -129.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:51,378 INFO L158 Benchmark]: Witness Printer took 51.96ms. Allocated memory is still 274.7MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:22:51,379 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.10ms. Allocated memory is still 155.2MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 72.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.44ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.10ms. Allocated memory is still 155.2MB. Free memory was 70.7MB in the beginning and 69.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 284.19ms. Allocated memory is still 155.2MB. Free memory was 69.2MB in the beginning and 59.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11063.52ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 58.3MB in the beginning and 187.4MB in the end (delta: -129.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.96ms. Allocated memory is still 274.7MB. Free memory was 187.4MB in the beginning and 185.3MB 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 439 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 72 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 317 SyntacticMatches, 28 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.2s InterpolantComputationTime, 444 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320 SizeOfPredicates, 10 NumberOfNonLiveVariables, 463 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-09 23:22:51,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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