./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-while_file-17.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 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:36:09,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:09,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:36:09,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:09,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:09,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:09,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:09,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:09,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:09,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:09,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:09,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:09,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:09,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:09,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:09,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:09,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:09,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:09,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:09,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 [2025-03-17 03:36:09,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:09,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:09,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:09,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:09,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:09,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:10,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a435b9b09/81ebe09b97824cd4ba21027097134918/FLAG6f8358a86 [2025-03-17 03:36:11,268 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:11,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:11,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a435b9b09/81ebe09b97824cd4ba21027097134918/FLAG6f8358a86 [2025-03-17 03:36:11,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a435b9b09/81ebe09b97824cd4ba21027097134918 [2025-03-17 03:36:11,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:11,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:11,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:11,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:11,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:11,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cd529f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11, skipping insertion in model container [2025-03-17 03:36:11,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:11,651 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-while_file-17.i[915,928] [2025-03-17 03:36:11,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:11,700 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:11,709 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-while_file-17.i[915,928] [2025-03-17 03:36:11,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:11,742 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:11,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11 WrapperNode [2025-03-17 03:36:11,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:11,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:11,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:11,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:11,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,779 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-17 03:36:11,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:11,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:11,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:11,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:11,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,810 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]. [2025-03-17 03:36:11,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:11,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:11,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:11,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:11,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (1/1) ... [2025-03-17 03:36:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:11,860 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) [2025-03-17 03:36:11,862 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 [2025-03-17 03:36:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:11,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:11,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:36:11,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:11,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:11,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:11,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:12,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-17 03:36:12,189 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:12,190 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:12,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:12,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:12,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:12 BoogieIcfgContainer [2025-03-17 03:36:12,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:12,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:12,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:12,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:12,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:11" (1/3) ... [2025-03-17 03:36:12,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ec434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:12, skipping insertion in model container [2025-03-17 03:36:12,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:11" (2/3) ... [2025-03-17 03:36:12,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ec434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:12, skipping insertion in model container [2025-03-17 03:36:12,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:12" (3/3) ... [2025-03-17 03:36:12,211 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:12,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:12,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-17.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:12,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:12,291 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;@3b1f609e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:12,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:36:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:36:12,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:12,307 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:12,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1600069503, now seen corresponding path program 1 times [2025-03-17 03:36:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669406] [2025-03-17 03:36:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:12,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:36:12,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:36:12,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:12,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:36:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669406] [2025-03-17 03:36:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416312599] [2025-03-17 03:36:12,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:12,608 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) [2025-03-17 03:36:12,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:36:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:36:12,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:36:12,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:12,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:12,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:12,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:36:12,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416312599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:12,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:36:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:36:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112731185] [2025-03-17 03:36:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:12,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:12,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:12,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:12,814 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:36:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:12,840 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2025-03-17 03:36:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-17 03:36:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:12,849 INFO L225 Difference]: With dead ends: 119 [2025-03-17 03:36:12,850 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 03:36:12,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:12,856 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:12,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 03:36:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 03:36:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:36:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-03-17 03:36:12,905 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 141 [2025-03-17 03:36:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:12,907 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-03-17 03:36:12,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:36:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-03-17 03:36:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:36:12,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:12,912 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:12,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:36:13,113 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 [2025-03-17 03:36:13,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:13,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -450799934, now seen corresponding path program 1 times [2025-03-17 03:36:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847592925] [2025-03-17 03:36:13,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:13,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:36:13,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:36:13,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:13,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:36:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886388494] [2025-03-17 03:36:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:13,261 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) [2025-03-17 03:36:13,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:36:13,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:36:13,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:36:13,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:13,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:36:13,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:36:13,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:36:13,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:13,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:13,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:36:13,526 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:36:13,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:36:13,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:36:13,733 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,SelfDestructingSolverStorable1 [2025-03-17 03:36:13,735 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:36:13,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:36:13,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:36:13 BoogieIcfgContainer [2025-03-17 03:36:13,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:36:13,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:36:13,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:36:13,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:36:13,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:12" (3/4) ... [2025-03-17 03:36:13,820 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:36:13,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:36:13,821 INFO L158 Benchmark]: Toolchain (without parser) took 2288.67ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 94.7MB in the end (delta: 28.0MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-03-17 03:36:13,822 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:13,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.56ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:13,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:13,822 INFO L158 Benchmark]: Boogie Preprocessor took 43.82ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:13,823 INFO L158 Benchmark]: IcfgBuilder took 376.90ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 89.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:36:13,823 INFO L158 Benchmark]: TraceAbstraction took 1613.27ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 94.7MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:13,823 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:13,824 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.56ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.82ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.90ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 89.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1613.27ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 94.7MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] double var_1_3 = 16.2; [L24] double var_1_4 = 7.5; [L25] double var_1_5 = 49.6; [L26] signed short int var_1_6 = -10; [L27] unsigned long int var_1_7 = 3280833198; [L28] unsigned long int var_1_8 = 10000000; [L29] signed short int var_1_10 = 1; [L30] signed long int var_1_11 = -32; [L31] double var_1_12 = 128.25; [L32] double var_1_13 = 4.4; [L33] signed long int var_1_14 = -1; [L34] signed long int var_1_15 = 4; [L35] signed long int var_1_16 = 64; [L36] signed long int var_1_17 = 4; [L37] unsigned char var_1_18 = 1; [L38] unsigned char var_1_19 = 1; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L56] var_1_3 = __VERIFIER_nondet_double() [L57] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L57] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L58] var_1_4 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L59] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L61] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L62] var_1_7 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L63] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L64] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L64] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L65] var_1_8 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L66] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L67] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L67] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L68] var_1_10 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L69] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L70] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L70] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L73] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L73] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L74] var_1_13 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L75] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L76] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L76] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L78] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L79] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L79] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L83] var_1_16 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L84] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L85] CALL assume_abort_if_not(var_1_16 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L85] RET assume_abort_if_not(var_1_16 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L86] var_1_17 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L88] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L88] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L89] var_1_19 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L90] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L91] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L91] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L104] RET updateVariables() [L105] CALL step() [L42] COND TRUE (var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) [L43] var_1_11 = (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))) VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L45] EXPR var_1_15 >> var_1_11 VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L45] COND TRUE ((var_1_15 >> var_1_11) * var_1_7) <= var_1_17 [L46] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L48] COND TRUE \read(var_1_18) [L49] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L51] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11 [L52] var_1_6 = var_1_10 VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L96-L97] return (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=-1, var_1_14=-1, var_1_15=0, var_1_16=-1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 86 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1980/2024 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:36:13,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-while_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:36:16,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:16,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:36:16,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:16,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:16,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:16,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:16,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:16,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:16,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:16,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:16,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:16,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:16,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:16,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:16,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:36:16,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:36:16,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:36:16,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:16,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:16,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:16,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:16,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:16,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:16,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:16,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:16,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:16,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:16,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:16,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:16,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:16,174 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:16,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 [2025-03-17 03:36:16,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:16,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:16,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:16,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:16,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:16,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:17,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b0c370/947beae017444d3bbe0dbe37d49fdb67/FLAGcdd2d3311 [2025-03-17 03:36:18,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:18,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:18,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b0c370/947beae017444d3bbe0dbe37d49fdb67/FLAGcdd2d3311 [2025-03-17 03:36:18,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b0c370/947beae017444d3bbe0dbe37d49fdb67 [2025-03-17 03:36:18,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:18,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:18,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:18,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:18,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:18,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34265593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18, skipping insertion in model container [2025-03-17 03:36:18,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:18,518 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-while_file-17.i[915,928] [2025-03-17 03:36:18,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:18,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:18,581 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-while_file-17.i[915,928] [2025-03-17 03:36:18,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:18,617 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:18,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18 WrapperNode [2025-03-17 03:36:18,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:18,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:18,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:18,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:18,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,648 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-17 03:36:18,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:18,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:18,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:18,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:18,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,667 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]. [2025-03-17 03:36:18,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:18,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:18,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:18,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:18,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (1/1) ... [2025-03-17 03:36:18,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:18,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:18,719 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) [2025-03-17 03:36:18,722 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 [2025-03-17 03:36:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:36:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:18,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:18,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:18,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:18,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:33,925 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:33,925 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:33,933 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:33,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:33,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:33 BoogieIcfgContainer [2025-03-17 03:36:33,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:33,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:33,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:33,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:33,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:18" (1/3) ... [2025-03-17 03:36:33,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7091cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:33, skipping insertion in model container [2025-03-17 03:36:33,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:18" (2/3) ... [2025-03-17 03:36:33,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7091cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:33, skipping insertion in model container [2025-03-17 03:36:33,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:33" (3/3) ... [2025-03-17 03:36:33,945 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-17.i [2025-03-17 03:36:33,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:33,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-17.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:33,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:34,008 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;@6ee27964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:34,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:36:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 03:36:34,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:34,024 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:34,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:34,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash -573993323, now seen corresponding path program 1 times [2025-03-17 03:36:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533464956] [2025-03-17 03:36:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:34,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:34,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:36:34,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 03:36:35,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 03:36:35,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:35,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:35,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:35,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:36:35,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:35,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533464956] [2025-03-17 03:36:35,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533464956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:35,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:35,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:36:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299375898] [2025-03-17 03:36:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:35,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:35,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:35,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:35,357 INFO L87 Difference]: Start difference. First operand has 53 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:36:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:35,376 INFO L93 Difference]: Finished difference Result 103 states and 183 transitions. [2025-03-17 03:36:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 137 [2025-03-17 03:36:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:35,384 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:36:35,384 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 03:36:35,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:35,389 INFO L435 NwaCegarLoop]: 77 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, 77 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 [2025-03-17 03:36:35,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 03:36:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 03:36:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:36:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2025-03-17 03:36:35,426 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 137 [2025-03-17 03:36:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:35,427 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2025-03-17 03:36:35,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:36:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2025-03-17 03:36:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 03:36:35,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:35,433 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:35,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:36:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:35,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:35,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash -126361768, now seen corresponding path program 1 times [2025-03-17 03:36:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849806189] [2025-03-17 03:36:35,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:35,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:35,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:36:35,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 03:36:36,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 03:36:36,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:36,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:36,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:36:36,833 INFO L279 TraceCheckSpWp]: Computing forward predicates...