./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:43:10,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:43:10,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:43:10,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:43:10,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:43:10,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:43:10,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:43:10,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:43:10,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:43:10,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:43:10,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:43:10,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:43:10,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:43:10,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:43:10,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:43:10,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:43:10,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:43:10,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:43:10,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:43:10,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:43:10,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:43:10,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:43:10,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:43:10,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:43:10,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:43:10,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:43:10,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:43:10,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:43:10,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:43:10,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:43:10,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:43:10,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:43:10,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:43:10,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:43:10,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:43:10,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:43:10,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:43:10,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:43:10,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:43:10,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:43:10,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:43:10,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:43:10,895 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-clean/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-clean/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 -> 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 [2024-10-11 11:43:11,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:43:11,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:43:11,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:43:11,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:43:11,211 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:43:11,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-10-11 11:43:12,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:43:12,915 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:43:12,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-10-11 11:43:12,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38651041b/a553fc8bc88143039a522fc5c617f49f/FLAG1cb4ebc5b [2024-10-11 11:43:13,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38651041b/a553fc8bc88143039a522fc5c617f49f [2024-10-11 11:43:13,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:43:13,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:43:13,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:43:13,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:43:13,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:43:13,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb5ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13, skipping insertion in model container [2024-10-11 11:43:13,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:43:13,550 WARN L248 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-while_file-86.i[915,928] [2024-10-11 11:43:13,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:43:13,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:43:13,645 WARN L248 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-while_file-86.i[915,928] [2024-10-11 11:43:13,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:43:13,686 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:43:13,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13 WrapperNode [2024-10-11 11:43:13,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:43:13,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:43:13,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:43:13,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:43:13,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,759 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-11 11:43:13,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:43:13,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:43:13,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:43:13,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:43:13,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,798 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-10-11 11:43:13,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:43:13,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:43:13,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:43:13,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:43:13,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (1/1) ... [2024-10-11 11:43:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:43:13,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:43:13,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:43:13,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:43:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:43:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:43:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:43:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:43:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:43:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:43:14,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:43:14,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:43:14,325 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 11:43:14,326 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:43:14,373 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:43:14,374 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:43:14,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:43:14 BoogieIcfgContainer [2024-10-11 11:43:14,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:43:14,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:43:14,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:43:14,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:43:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:43:13" (1/3) ... [2024-10-11 11:43:14,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b8756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:43:14, skipping insertion in model container [2024-10-11 11:43:14,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:13" (2/3) ... [2024-10-11 11:43:14,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b8756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:43:14, skipping insertion in model container [2024-10-11 11:43:14,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:43:14" (3/3) ... [2024-10-11 11:43:14,386 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-86.i [2024-10-11 11:43:14,403 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:43:14,403 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:43:14,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:43:14,475 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;@70f53927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:43:14,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:43:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:43:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:43:14,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:14,492 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:43:14,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:14,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 826885512, now seen corresponding path program 1 times [2024-10-11 11:43:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:43:14,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733834861] [2024-10-11 11:43:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:43:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:43:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:43:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:43:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:43:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:43:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:43:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:43:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:43:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:43:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:43:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:43:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:43:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:43:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:43:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:43:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:43:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:43:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:43:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:43:14,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733834861] [2024-10-11 11:43:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733834861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:43:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817526039] [2024-10-11 11:43:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:14,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:43:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:43:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:43:14,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:43:14,996 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:43:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:15,037 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2024-10-11 11:43:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:43:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-11 11:43:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:15,049 INFO L225 Difference]: With dead ends: 87 [2024-10-11 11:43:15,049 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 11:43:15,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-11 11:43:15,056 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:15,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:43:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 11:43:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 11:43:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:43:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-11 11:43:15,109 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 104 [2024-10-11 11:43:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:15,110 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-11 11:43:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:43:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-11 11:43:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:43:15,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:15,115 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:43:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:43:15,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -995657206, now seen corresponding path program 1 times [2024-10-11 11:43:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:43:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086359590] [2024-10-11 11:43:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:43:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:43:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:43:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:43:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:43:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:43:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:43:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:43:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:43:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:43:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:43:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:43:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:43:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:43:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:43:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:43:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:43:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:43:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:43:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:43:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086359590] [2024-10-11 11:43:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086359590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:17,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:43:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581969026] [2024-10-11 11:43:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:17,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:43:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:43:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:43:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:43:17,983 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:43:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:18,169 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2024-10-11 11:43:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:43:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-11 11:43:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:18,174 INFO L225 Difference]: With dead ends: 127 [2024-10-11 11:43:18,175 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 11:43:18,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:43:18,178 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:18,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 130 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:43:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 11:43:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-10-11 11:43:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 11:43:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-10-11 11:43:18,212 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 104 [2024-10-11 11:43:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-10-11 11:43:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:43:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-10-11 11:43:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:43:18,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:18,216 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:43:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:43:18,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash -995597624, now seen corresponding path program 1 times [2024-10-11 11:43:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:43:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139599865] [2024-10-11 11:43:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:43:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:43:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:43:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:43:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:43:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:43:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:43:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:43:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:43:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:43:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:43:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:43:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:43:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:43:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:43:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:43:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:43:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:43:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:43:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139599865] [2024-10-11 11:43:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139599865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:20,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:20,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:43:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761742214] [2024-10-11 11:43:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:43:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:43:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:43:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:43:20,965 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:21,382 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2024-10-11 11:43:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:43:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-11 11:43:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:21,387 INFO L225 Difference]: With dead ends: 158 [2024-10-11 11:43:21,388 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 11:43:21,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:43:21,391 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:21,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 168 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:43:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 11:43:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-10-11 11:43:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:43:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 230 transitions. [2024-10-11 11:43:21,426 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 230 transitions. Word has length 104 [2024-10-11 11:43:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:21,426 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 230 transitions. [2024-10-11 11:43:21,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2024-10-11 11:43:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:43:21,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:21,430 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:43:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:43:21,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -315539254, now seen corresponding path program 1 times [2024-10-11 11:43:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:43:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184127768] [2024-10-11 11:43:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:43:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:43:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:43:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:43:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:43:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:43:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:43:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:43:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:43:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:43:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:43:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:43:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:43:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:43:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:43:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:43:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:43:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:43:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:43:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:43:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184127768] [2024-10-11 11:43:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184127768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:21,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:43:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314435672] [2024-10-11 11:43:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:43:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:43:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:43:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:43:21,621 INFO L87 Difference]: Start difference. First operand 153 states and 230 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:21,666 INFO L93 Difference]: Finished difference Result 373 states and 561 transitions. [2024-10-11 11:43:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:43:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-11 11:43:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:21,671 INFO L225 Difference]: With dead ends: 373 [2024-10-11 11:43:21,671 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 11:43:21,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:43:21,674 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:21,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:43:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 11:43:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2024-10-11 11:43:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 119 states have internal predecessors, (137), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 11:43:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 329 transitions. [2024-10-11 11:43:21,716 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 329 transitions. Word has length 104 [2024-10-11 11:43:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:21,717 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 329 transitions. [2024-10-11 11:43:21,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 329 transitions. [2024-10-11 11:43:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:43:21,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:21,721 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:43:21,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:43:21,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -372797556, now seen corresponding path program 1 times [2024-10-11 11:43:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:43:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491155729] [2024-10-11 11:43:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:43:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:43:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:43:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:43:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:43:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:43:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:43:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:43:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:43:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:43:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:43:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:43:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:43:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:43:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:43:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:43:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:43:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:43:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:43:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:43:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491155729] [2024-10-11 11:43:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491155729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:43:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550762331] [2024-10-11 11:43:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:23,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:43:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:43:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:43:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:43:23,777 INFO L87 Difference]: Start difference. First operand 219 states and 329 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:24,058 INFO L93 Difference]: Finished difference Result 219 states and 329 transitions. [2024-10-11 11:43:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:43:24,059 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-11 11:43:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:24,061 INFO L225 Difference]: With dead ends: 219 [2024-10-11 11:43:24,061 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:43:24,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:43:24,065 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:24,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:43:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:43:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:43:24,069 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-10-11 11:43:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:43:24,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2024-10-11 11:43:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:24,070 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:43:24,070 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:43:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:43:24,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:43:24,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:43:24,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:43:24,081 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 11:43:24,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:43:24,485 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:43:24,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:43:24 BoogieIcfgContainer [2024-10-11 11:43:24,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:43:24,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:43:24,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:43:24,519 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:43:24,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:43:14" (3/4) ... [2024-10-11 11:43:24,521 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:43:24,525 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:43:24,531 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 11:43:24,531 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 11:43:24,531 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:43:24,532 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:43:24,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:43:24,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:43:24,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:43:24,629 INFO L158 Benchmark]: Toolchain (without parser) took 11338.40ms. Allocated memory was 157.3MB in the beginning and 364.9MB in the end (delta: 207.6MB). Free memory was 99.8MB in the beginning and 229.0MB in the end (delta: -129.3MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,629 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:43:24,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.60ms. Allocated memory is still 157.3MB. Free memory was 99.8MB in the beginning and 124.7MB in the end (delta: -24.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.36ms. Allocated memory is still 157.3MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,631 INFO L158 Benchmark]: Boogie Preprocessor took 56.20ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,631 INFO L158 Benchmark]: RCFGBuilder took 557.90ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 93.9MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,631 INFO L158 Benchmark]: TraceAbstraction took 10140.45ms. Allocated memory was 157.3MB in the beginning and 364.9MB in the end (delta: 207.6MB). Free memory was 93.9MB in the beginning and 235.3MB in the end (delta: -141.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,632 INFO L158 Benchmark]: Witness Printer took 109.37ms. Allocated memory is still 364.9MB. Free memory was 235.3MB in the beginning and 229.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:43:24,633 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.67ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.60ms. Allocated memory is still 157.3MB. Free memory was 99.8MB in the beginning and 124.7MB in the end (delta: -24.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.36ms. Allocated memory is still 157.3MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.20ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 557.90ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 93.9MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10140.45ms. Allocated memory was 157.3MB in the beginning and 364.9MB in the end (delta: 207.6MB). Free memory was 93.9MB in the beginning and 235.3MB in the end (delta: -141.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 109.37ms. Allocated memory is still 364.9MB. Free memory was 235.3MB in the beginning and 229.0MB in the end (delta: 6.3MB). 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 614 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 327 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 287 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 3518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2720/2720 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: 95]: Loop Invariant Derived loop invariant: (((((var_1_1 == var_1_7) && ((var_1_16 == var_1_18) || ((var_1_13 + (((((((4294967295 * last_1_var_1_1) + 4294967196) + var_1_17) + (4294967295 * var_1_11)) >= 0) ? (((((4294967295 * last_1_var_1_1) + 4294967196) + var_1_17) + (4294967295 * var_1_11)) / 4294967296) : ((((((4294967295 * last_1_var_1_1) + 4294967196) + var_1_17) + (4294967295 * var_1_11)) / 4294967296) - 1)) * 4294967296)) < ((((4294967295 * last_1_var_1_1) + 4294967197) + var_1_17) + (4294967295 * var_1_11))))) && ((((((((0 < (var_1_3 + 1)) || (0 == var_1_16)) || (0 < ((long long) var_1_8 + 1))) || (var_1_7 == var_1_11)) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0)) && ((((0 == var_1_16) || (var_1_7 == var_1_11)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) && (((0 == var_1_16) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_7 == var_1_11))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) && (((0 < var_1_7) || (var_1_12 == 0)) || ((var_1_7 + (((((long long) (-1 * var_1_7) + var_1_13) >= 0) ? (((long long) (-1 * var_1_7) + var_1_13) / 4294967296) : ((((long long) (-1 * var_1_7) + var_1_13) / 4294967296) - 1)) * 4294967296)) < var_1_13))) || (((((var_1_16 <= 0) && (var_1_7 == 4)) && (var_1_16 == var_1_18)) && (0 <= 0)) && (0 <= var_1_16))) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:43:24,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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