./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i -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 d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:43:29,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:43:29,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:43:29,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:43:29,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:43:29,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:43:29,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:43:29,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:43:29,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:43:29,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:43:29,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:43:29,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:43:29,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:43:29,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:43:29,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:43:29,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:43:29,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:43:29,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:43:29,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:43:29,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:43:29,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:43:29,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:43:29,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:43:29,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:43:29,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:43:29,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:43:29,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:43:29,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:43:29,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:43:29,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:43:29,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:43:29,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:43:29,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:43:29,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:43:29,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:43:29,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:43:29,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:43:29,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:43:29,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:43:29,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:43:29,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:43:29,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:43:29,557 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 -> d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 [2024-11-18 22:43:29,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:43:29,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:43:29,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:43:29,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:43:29,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:43:29,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-11-18 22:43:31,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:43:31,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:43:31,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-11-18 22:43:31,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd5e74c5/ba3d611b01da4c3685de3f4f19fb4a33/FLAG0b87798e3 [2024-11-18 22:43:31,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd5e74c5/ba3d611b01da4c3685de3f4f19fb4a33 [2024-11-18 22:43:31,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:43:31,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:43:31,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:43:31,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:43:31,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:43:31,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:31,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39560e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31, skipping insertion in model container [2024-11-18 22:43:31,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:31,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:43:31,822 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2024-11-18 22:43:31,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:43:31,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:43:31,916 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2024-11-18 22:43:31,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:43:31,953 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:43:31,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31 WrapperNode [2024-11-18 22:43:31,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:43:31,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:43:31,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:43:31,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:43:31,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:31,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,003 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2024-11-18 22:43:32,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:43:32,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:43:32,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:43:32,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:43:32,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,033 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-18 22:43:32,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:43:32,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:43:32,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:43:32,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:43:32,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (1/1) ... [2024-11-18 22:43:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:43:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:43:32,086 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-18 22:43:32,088 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-18 22:43:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:43:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:43:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:43:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:43:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:43:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:43:32,185 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:43:32,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:43:32,372 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-18 22:43:32,372 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:43:32,385 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:43:32,385 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:43:32,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:32 BoogieIcfgContainer [2024-11-18 22:43:32,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:43:32,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:43:32,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:43:32,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:43:32,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:43:31" (1/3) ... [2024-11-18 22:43:32,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7d4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:32, skipping insertion in model container [2024-11-18 22:43:32,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:31" (2/3) ... [2024-11-18 22:43:32,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7d4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:32, skipping insertion in model container [2024-11-18 22:43:32,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:32" (3/3) ... [2024-11-18 22:43:32,394 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-11-18 22:43:32,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:43:32,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:43:32,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:43:32,476 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;@46cd0052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:43:32,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:43:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 22:43:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 22:43:32,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:32,488 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:32,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -793587933, now seen corresponding path program 1 times [2024-11-18 22:43:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885914221] [2024-11-18 22:43:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-18 22:43:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885914221] [2024-11-18 22:43:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885914221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:43:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961574303] [2024-11-18 22:43:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:32,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:43:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:43:32,728 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-18 22:43:32,730 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-18 22:43:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:32,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:43:32,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:43:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-18 22:43:32,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:43:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961574303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:43:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:43:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048821214] [2024-11-18 22:43:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:43:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:43:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:43:32,889 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-18 22:43:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:32,908 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2024-11-18 22:43:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:43:32,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-18 22:43:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:32,918 INFO L225 Difference]: With dead ends: 77 [2024-11-18 22:43:32,918 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 22:43:32,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:43:32,924 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:32,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:43:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 22:43:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-18 22:43:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 22:43:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-18 22:43:32,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 63 [2024-11-18 22:43:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-18 22:43:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-18 22:43:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-18 22:43:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 22:43:32,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:32,971 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:32,992 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-18 22:43:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:43:33,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 514983137, now seen corresponding path program 1 times [2024-11-18 22:43:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819659526] [2024-11-18 22:43:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-18 22:43:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819659526] [2024-11-18 22:43:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819659526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:43:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 22:43:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665196247] [2024-11-18 22:43:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 22:43:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 22:43:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-18 22:43:35,489 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:35,804 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2024-11-18 22:43:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:43:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-18 22:43:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:35,808 INFO L225 Difference]: With dead ends: 99 [2024-11-18 22:43:35,809 INFO L226 Difference]: Without dead ends: 97 [2024-11-18 22:43:35,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:43:35,811 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:35,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 201 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:43:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-18 22:43:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2024-11-18 22:43:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:43:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-18 22:43:35,841 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 63 [2024-11-18 22:43:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:35,841 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-18 22:43:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-18 22:43:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 22:43:35,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:35,845 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:35,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:43:35,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 516830179, now seen corresponding path program 1 times [2024-11-18 22:43:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543669968] [2024-11-18 22:43:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-18 22:43:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543669968] [2024-11-18 22:43:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543669968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:37,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:43:37,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 22:43:37,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938802992] [2024-11-18 22:43:37,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:43:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:43:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:43:37,066 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:37,414 INFO L93 Difference]: Finished difference Result 244 states and 325 transitions. [2024-11-18 22:43:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 22:43:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-18 22:43:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:37,417 INFO L225 Difference]: With dead ends: 244 [2024-11-18 22:43:37,417 INFO L226 Difference]: Without dead ends: 174 [2024-11-18 22:43:37,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-18 22:43:37,423 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 76 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:37,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 318 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:43:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-18 22:43:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 144. [2024-11-18 22:43:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 99 states have internal predecessors, (115), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 22:43:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2024-11-18 22:43:37,464 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 63 [2024-11-18 22:43:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:37,465 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2024-11-18 22:43:37,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2024-11-18 22:43:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 22:43:37,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:37,469 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:43:37,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -246307624, now seen corresponding path program 1 times [2024-11-18 22:43:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938130323] [2024-11-18 22:43:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-18 22:43:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:37,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938130323] [2024-11-18 22:43:37,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938130323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:37,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:43:37,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:43:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209455390] [2024-11-18 22:43:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:43:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:43:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:43:37,593 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:37,680 INFO L93 Difference]: Finished difference Result 392 states and 507 transitions. [2024-11-18 22:43:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:43:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-18 22:43:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:37,684 INFO L225 Difference]: With dead ends: 392 [2024-11-18 22:43:37,684 INFO L226 Difference]: Without dead ends: 251 [2024-11-18 22:43:37,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:43:37,686 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:37,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 142 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:43:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-18 22:43:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2024-11-18 22:43:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.141732283464567) internal successors, (145), 129 states have internal predecessors, (145), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 22:43:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 253 transitions. [2024-11-18 22:43:37,723 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 253 transitions. Word has length 64 [2024-11-18 22:43:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:37,724 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 253 transitions. [2024-11-18 22:43:37,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2024-11-18 22:43:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 22:43:37,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:37,729 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:37,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:43:37,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:37,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 13094305, now seen corresponding path program 1 times [2024-11-18 22:43:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671454740] [2024-11-18 22:43:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-18 22:43:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671454740] [2024-11-18 22:43:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671454740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:43:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 22:43:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693447929] [2024-11-18 22:43:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 22:43:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 22:43:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-18 22:43:39,675 INFO L87 Difference]: Start difference. First operand 192 states and 253 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:39,928 INFO L93 Difference]: Finished difference Result 335 states and 435 transitions. [2024-11-18 22:43:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:43:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-18 22:43:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:39,931 INFO L225 Difference]: With dead ends: 335 [2024-11-18 22:43:39,931 INFO L226 Difference]: Without dead ends: 241 [2024-11-18 22:43:39,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:43:39,933 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:39,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 243 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:43:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-18 22:43:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 198. [2024-11-18 22:43:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.150375939849624) internal successors, (153), 135 states have internal predecessors, (153), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 22:43:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 261 transitions. [2024-11-18 22:43:39,972 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 261 transitions. Word has length 64 [2024-11-18 22:43:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 261 transitions. [2024-11-18 22:43:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-18 22:43:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 261 transitions. [2024-11-18 22:43:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 22:43:39,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:39,974 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 22:43:39,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 70352607, now seen corresponding path program 1 times [2024-11-18 22:43:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010003769] [2024-11-18 22:43:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-18 22:43:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010003769] [2024-11-18 22:43:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010003769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:43:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424737604] [2024-11-18 22:43:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:40,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:43:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:43:40,130 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-18 22:43:40,135 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-18 22:43:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:40,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:43:40,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:43:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-18 22:43:40,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:43:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-18 22:43:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424737604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:43:40,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:43:40,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-18 22:43:40,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737540262] [2024-11-18 22:43:40,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:43:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:43:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:40,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:43:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:43:40,424 INFO L87 Difference]: Start difference. First operand 198 states and 261 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:43:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:40,568 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2024-11-18 22:43:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:43:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 64 [2024-11-18 22:43:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:40,572 INFO L225 Difference]: With dead ends: 318 [2024-11-18 22:43:40,572 INFO L226 Difference]: Without dead ends: 123 [2024-11-18 22:43:40,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:43:40,576 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:40,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:43:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-18 22:43:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-18 22:43:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-18 22:43:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2024-11-18 22:43:40,594 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 64 [2024-11-18 22:43:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:40,595 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2024-11-18 22:43:40,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:43:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2024-11-18 22:43:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-18 22:43:40,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:43:40,600 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:40,617 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-18 22:43:40,801 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,SelfDestructingSolverStorable5 [2024-11-18 22:43:40,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:43:40,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:43:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2108356367, now seen corresponding path program 1 times [2024-11-18 22:43:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:43:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113659035] [2024-11-18 22:43:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:43:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:43:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:43:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113659035] [2024-11-18 22:43:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113659035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:43:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455316055] [2024-11-18 22:43:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:43:40,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:43:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:43:40,903 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-18 22:43:40,905 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-18 22:43:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:43:41,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 22:43:41,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:43:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-18 22:43:41,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:43:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455316055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:43:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:43:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-18 22:43:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168449748] [2024-11-18 22:43:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:43:41,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:43:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:43:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:43:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:43:41,066 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:43:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:43:41,094 INFO L93 Difference]: Finished difference Result 151 states and 183 transitions. [2024-11-18 22:43:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:43:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-18 22:43:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:43:41,095 INFO L225 Difference]: With dead ends: 151 [2024-11-18 22:43:41,096 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 22:43:41,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:43:41,097 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:43:41,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:43:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 22:43:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 22:43:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 22:43:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 22:43:41,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2024-11-18 22:43:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:43:41,099 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 22:43:41,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:43:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 22:43:41,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 22:43:41,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:43:41,121 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-18 22:43:41,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:43:41,306 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:43:41,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 22:43:41,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:43:41,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:43:41 BoogieIcfgContainer [2024-11-18 22:43:41,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:43:41,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:43:41,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:43:41,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:43:41,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:32" (3/4) ... [2024-11-18 22:43:41,825 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 22:43:41,829 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-18 22:43:41,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-18 22:43:41,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 22:43:41,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 22:43:41,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 22:43:41,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 22:43:41,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 22:43:41,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:43:41,931 INFO L158 Benchmark]: Toolchain (without parser) took 10401.35ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 103.3MB in the beginning and 131.9MB in the end (delta: -28.6MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,931 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:43:41,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.34ms. Allocated memory is still 169.9MB. Free memory was 103.0MB in the beginning and 138.9MB in the end (delta: -35.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.23ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,932 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 169.9MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,932 INFO L158 Benchmark]: RCFGBuilder took 337.19ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 120.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,932 INFO L158 Benchmark]: TraceAbstraction took 9433.02ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 119.3MB in the beginning and 137.2MB in the end (delta: -17.9MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,932 INFO L158 Benchmark]: Witness Printer took 108.46ms. Allocated memory is still 323.0MB. Free memory was 137.2MB in the beginning and 131.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 22:43:41,934 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.23ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.34ms. Allocated memory is still 169.9MB. Free memory was 103.0MB in the beginning and 138.9MB in the end (delta: -35.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.23ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 169.9MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.19ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 120.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9433.02ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 119.3MB in the beginning and 137.2MB in the end (delta: -17.9MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. * Witness Printer took 108.46ms. Allocated memory is still 323.0MB. Free memory was 137.2MB in the beginning and 131.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 1113 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 775 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 338 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 168 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 2268 SizeOfPredicates, 2 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 2513/2566 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((var_1_5 == 0) && (0 <= k_loop)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (var_1_11 <= 0)) || ((((1 <= k_loop) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (var_1_11 <= 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((last_1_var_1_5 <= 0) && (var_1_5 == 0)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (0 <= 0)) Ensures: (((((((cond != 0) && (last_1_var_1_5 <= 0)) && (var_1_5 == 0)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (0 <= 0)) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_17 == \old(last_1_var_1_17)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 22:43:41,967 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 Result: TRUE