./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:08:36,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:08:36,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:08:37,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:08:37,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:08:37,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:08:37,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:08:37,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:08:37,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:08:37,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:08:37,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:08:37,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:08:37,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:08:37,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:08:37,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:08:37,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:37,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:08:37,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:08:37,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:08:37,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:08:37,034 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-jdk21/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 -> e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 [2025-02-06 01:08:37,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:08:37,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:08:37,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:08:37,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:08:37,328 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:08:37,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:08:38,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c54630e1e/57bf16bbef814d2580285fa880d1b190/FLAG0035b60ce [2025-02-06 01:08:38,927 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:08:38,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:08:38,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c54630e1e/57bf16bbef814d2580285fa880d1b190/FLAG0035b60ce [2025-02-06 01:08:38,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c54630e1e/57bf16bbef814d2580285fa880d1b190 [2025-02-06 01:08:38,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:08:38,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:08:38,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:38,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:08:38,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:08:38,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:38" (1/1) ... [2025-02-06 01:08:38,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c09d067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:38, skipping insertion in model container [2025-02-06 01:08:38,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:38" (1/1) ... [2025-02-06 01:08:38,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:08:39,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i[915,928] [2025-02-06 01:08:39,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:39,149 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:08:39,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i[915,928] [2025-02-06 01:08:39,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:39,193 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:08:39,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39 WrapperNode [2025-02-06 01:08:39,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:39,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:39,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:08:39,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:08:39,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,236 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-02-06 01:08:39,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:39,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:08:39,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:08:39,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:08:39,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,266 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-02-06 01:08:39,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:08:39,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:08:39,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:08:39,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:08:39,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (1/1) ... [2025-02-06 01:08:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:39,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:08:39,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:08:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:08:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:08:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:08:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:08:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:08:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:08:39,399 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:08:39,401 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:08:39,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-02-06 01:08:39,630 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:08:39,631 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:08:39,645 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:08:39,645 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:08:39,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:39 BoogieIcfgContainer [2025-02-06 01:08:39,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:08:39,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:08:39,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:08:39,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:08:39,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:08:38" (1/3) ... [2025-02-06 01:08:39,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f56360c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:39, skipping insertion in model container [2025-02-06 01:08:39,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:39" (2/3) ... [2025-02-06 01:08:39,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f56360c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:39, skipping insertion in model container [2025-02-06 01:08:39,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:39" (3/3) ... [2025-02-06 01:08:39,656 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:08:39,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:08:39,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:08:39,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:08:39,741 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;@9f8f784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:08:39,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:08:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 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-02-06 01:08:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 01:08:39,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:39,759 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, 1, 1, 1] [2025-02-06 01:08:39,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:39,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2090532826, now seen corresponding path program 1 times [2025-02-06 01:08:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651789260] [2025-02-06 01:08:39,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:39,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 01:08:39,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 01:08:39,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:39,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:08:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651789260] [2025-02-06 01:08:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651789260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:08:40,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552726328] [2025-02-06 01:08:40,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:40,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:40,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:08:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:08:40,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 01:08:40,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 01:08:40,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:40,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:40,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:08:40,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:08:40,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:08:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552726328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:08:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:08:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93284073] [2025-02-06 01:08:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:08:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:08:40,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:08:40,281 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-02-06 01:08:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:40,312 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2025-02-06 01:08:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:08:40,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 144 [2025-02-06 01:08:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:40,321 INFO L225 Difference]: With dead ends: 127 [2025-02-06 01:08:40,321 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 01:08:40,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-02-06 01:08:40,329 INFO L435 NwaCegarLoop]: 92 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, 92 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-02-06 01:08:40,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:08:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 01:08:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 01:08:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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-02-06 01:08:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2025-02-06 01:08:40,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 144 [2025-02-06 01:08:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:40,376 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2025-02-06 01:08:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-02-06 01:08:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2025-02-06 01:08:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 01:08:40,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:40,381 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, 1, 1, 1] [2025-02-06 01:08:40,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:08:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:08:40,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 153565033, now seen corresponding path program 1 times [2025-02-06 01:08:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486312404] [2025-02-06 01:08:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:40,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 01:08:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 01:08:40,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:40,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:08:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884314087] [2025-02-06 01:08:40,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:40,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:08:40,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:08:40,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 01:08:40,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 01:08:40,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:40,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:08:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 01:08:40,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 01:08:40,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:40,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:41,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:08:41,040 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:08:41,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:08:41,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:08:41,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:41,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 01:08:41,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:08:41,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:08:41 BoogieIcfgContainer [2025-02-06 01:08:41,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:08:41,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:08:41,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:08:41,353 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:08:41,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:39" (3/4) ... [2025-02-06 01:08:41,356 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:08:41,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:08:41,358 INFO L158 Benchmark]: Toolchain (without parser) took 2410.61ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 60.5MB in the end (delta: 43.3MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2025-02-06 01:08:41,358 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:41,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.74ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 91.2MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:41,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.99ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:41,360 INFO L158 Benchmark]: Boogie Preprocessor took 43.79ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:41,360 INFO L158 Benchmark]: IcfgBuilder took 360.39ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 70.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:41,360 INFO L158 Benchmark]: TraceAbstraction took 1703.60ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 61.3MB in the end (delta: 9.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-06 01:08:41,361 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 60.5MB in the end (delta: 798.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:41,363 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.74ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 91.2MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.99ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.79ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.39ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 70.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1703.60ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 61.3MB in the end (delta: 9.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 60.5MB in the end (delta: 798.3kB). 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 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. 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; VAL [isInitial=0, 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_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L100] isInitial = 1 [L101] FCALL initially() [L102] int k_loop; [L103] k_loop = 0 VAL [isInitial=1, k_loop=0, 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_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L103] COND TRUE k_loop < 1 [L104] FCALL updateLastVariables() [L105] 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=2147483647, 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=2147483647, 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=2147483647, 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=2147483647, 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=2147483647, 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=2147483647, 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=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=2147483647] [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=2147483647] [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=2147483647, var_1_8=0] [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=2147483647, var_1_8=0] [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=2147483647, var_1_8=0] [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=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L69] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L70] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L70] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [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=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [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=0, 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=2147483647, var_1_8=0] [L73] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L73] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [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=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [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=0, 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=2147483647, var_1_8=0] [L76] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [L76] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=0, 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=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L78] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L79] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, 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=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L84] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_16 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L85] RET assume_abort_if_not(var_1_16 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L88] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L90] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L91] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L105] RET updateVariables() [L106] CALL step() [L42] COND FALSE !((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L45] EXPR var_1_15 >> var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [L106] RET step() [L107] 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=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [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) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 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, 92 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, 92 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 314 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-02-06 01:08:41,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:08:43,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:08:43,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:08:43,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:08:43,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:08:43,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:08:43,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:08:43,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:08:43,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:08:43,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:08:43,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:08:43,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:08:43,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:08:43,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:08:43,757 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:08:43,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:08:43,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:08:43,757 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:08:43,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:08:43,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:08:43,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:08:43,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:08:43,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:08:43,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:43,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:08:43,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:08:43,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:08:43,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:08:43,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:08:43,762 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-jdk21/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 -> e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 [2025-02-06 01:08:44,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:08:44,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:08:44,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:08:44,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:08:44,057 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:08:44,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:08:45,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01179e792/f5f0b271b23a4cc99bfd539c1cdac8e9/FLAGb36e9b737 [2025-02-06 01:08:45,634 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:08:45,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:08:45,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01179e792/f5f0b271b23a4cc99bfd539c1cdac8e9/FLAGb36e9b737 [2025-02-06 01:08:45,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01179e792/f5f0b271b23a4cc99bfd539c1cdac8e9 [2025-02-06 01:08:45,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:08:45,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:08:45,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:45,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:08:45,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:08:45,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:45,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e431816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45, skipping insertion in model container [2025-02-06 01:08:45,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:45,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:08:45,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i[915,928] [2025-02-06 01:08:45,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:45,895 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:08:45,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i[915,928] [2025-02-06 01:08:45,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:45,948 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:08:45,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45 WrapperNode [2025-02-06 01:08:45,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:45,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:45,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:08:45,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:08:45,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:45,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,003 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-02-06 01:08:46,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:46,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:08:46,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:08:46,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:08:46,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,044 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-02-06 01:08:46,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:08:46,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:08:46,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:08:46,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:08:46,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (1/1) ... [2025-02-06 01:08:46,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:46,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:08:46,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:08:46,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:08:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:08:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:08:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:08:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:08:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:08:46,223 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:08:46,225 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:09:00,822 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 01:09:00,822 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:09:00,830 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:09:00,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:09:00,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:00 BoogieIcfgContainer [2025-02-06 01:09:00,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:09:00,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:09:00,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:09:00,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:09:00,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:08:45" (1/3) ... [2025-02-06 01:09:00,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6329721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:00, skipping insertion in model container [2025-02-06 01:09:00,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:45" (2/3) ... [2025-02-06 01:09:00,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6329721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:00, skipping insertion in model container [2025-02-06 01:09:00,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:00" (3/3) ... [2025-02-06 01:09:00,841 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-02-06 01:09:00,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:09:00,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:09:00,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:09:00,907 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;@7d0ecaea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:09:00,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:09:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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-02-06 01:09:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 01:09:00,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:00,924 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-02-06 01:09:00,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1472885661, now seen corresponding path program 1 times [2025-02-06 01:09:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150298097] [2025-02-06 01:09:00,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:00,939 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-02-06 01:09:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:00,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 01:09:00,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 01:09:01,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 01:09:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 01:09:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:02,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:09:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-02-06 01:09:02,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:02,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150298097] [2025-02-06 01:09:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150298097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:09:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063394444] [2025-02-06 01:09:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:02,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:09:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:02,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:09:02,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:09:02,151 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:09:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:02,180 INFO L93 Difference]: Finished difference Result 113 states and 192 transitions. [2025-02-06 01:09:02,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:09:02,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-02-06 01:09:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:02,188 INFO L225 Difference]: With dead ends: 113 [2025-02-06 01:09:02,189 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 01:09:02,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-02-06 01:09:02,194 INFO L435 NwaCegarLoop]: 84 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, 84 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-02-06 01:09:02,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:09:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 01:09:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 01:09:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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-02-06 01:09:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-02-06 01:09:02,244 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 141 [2025-02-06 01:09:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-02-06 01:09:02,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:09:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-02-06 01:09:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 01:09:02,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:02,253 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-02-06 01:09:02,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 01:09:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 01:09:02,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1830405318, now seen corresponding path program 1 times [2025-02-06 01:09:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214027220] [2025-02-06 01:09:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:02,456 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-02-06 01:09:02,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:02,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 01:09:02,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 01:09:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 01:09:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 01:09:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:03,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 01:09:03,668 INFO L279 TraceCheckSpWp]: Computing forward predicates...