./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_floatingpointinfluence_no-floats_file-91.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 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:47:37,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:47:37,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:47:37,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:47:37,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:47:37,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:47:37,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:47:37,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:47:37,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:47:37,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:47:37,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:47:37,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:47:37,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:47:37,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:47:37,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:47:37,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:47:37,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:37,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:37,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:47:37,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:47:37,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:47:37,975 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 -> 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 [2025-01-09 12:47:38,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:47:38,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:47:38,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:47:38,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:47:38,201 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:47:38,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:47:39,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4312f933/1d300304da31405799319a980db66d2d/FLAG4f4cf2ceb [2025-01-09 12:47:39,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:47:39,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:47:39,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4312f933/1d300304da31405799319a980db66d2d/FLAG4f4cf2ceb [2025-01-09 12:47:39,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4312f933/1d300304da31405799319a980db66d2d [2025-01-09 12:47:39,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:47:39,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:47:39,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:47:39,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:47:39,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:47:39,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:47:39" (1/1) ... [2025-01-09 12:47:39,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:39, skipping insertion in model container [2025-01-09 12:47:39,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:47:39" (1/1) ... [2025-01-09 12:47:39,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:47:40,008 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_floatingpointinfluence_no-floats_file-91.i[916,929] [2025-01-09 12:47:40,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:47:40,047 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:47:40,055 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_floatingpointinfluence_no-floats_file-91.i[916,929] [2025-01-09 12:47:40,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:47:40,094 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:47:40,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40 WrapperNode [2025-01-09 12:47:40,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:47:40,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:47:40,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:47:40,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:47:40,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,121 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-01-09 12:47:40,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:47:40,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:47:40,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:47:40,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:47:40,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,153 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-01-09 12:47:40,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:47:40,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:47:40,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:47:40,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:47:40,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (1/1) ... [2025-01-09 12:47:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:40,204 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-01-09 12:47:40,209 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-01-09 12:47:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:47:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:47:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:47:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:47:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:47:40,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:47:40,282 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:47:40,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:47:40,454 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 12:47:40,454 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:47:40,462 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:47:40,462 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:47:40,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:40 BoogieIcfgContainer [2025-01-09 12:47:40,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:47:40,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:47:40,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:47:40,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:47:40,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:47:39" (1/3) ... [2025-01-09 12:47:40,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa63135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:47:40, skipping insertion in model container [2025-01-09 12:47:40,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:40" (2/3) ... [2025-01-09 12:47:40,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa63135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:47:40, skipping insertion in model container [2025-01-09 12:47:40,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:40" (3/3) ... [2025-01-09 12:47:40,469 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:47:40,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:47:40,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-91.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:47:40,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:47:40,535 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;@33936c86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:47:40,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:47:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:47:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:47:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:40,551 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:40,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 758919511, now seen corresponding path program 1 times [2025-01-09 12:47:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-01-09 12:47:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:40,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:40,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:47:40,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:47:40,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 12:47:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-01-09 12:47:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942360696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197078276] [2025-01-09 12:47:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:40,764 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-01-09 12:47:40,765 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-01-09 12:47:40,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:47:40,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:47:40,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:40,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:40,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:47:40,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 12:47:40,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:47:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197078276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:47:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:47:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278032676] [2025-01-09 12:47:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:47:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:40,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:47:40,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:47:40,953 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:47:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:40,968 INFO L93 Difference]: Finished difference Result 104 states and 181 transitions. [2025-01-09 12:47:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:47:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-01-09 12:47:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:40,973 INFO L225 Difference]: With dead ends: 104 [2025-01-09 12:47:40,974 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 12:47:40,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-01-09 12:47:40,978 INFO L435 NwaCegarLoop]: 78 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, 78 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-01-09 12:47:40,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 12:47:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 12:47:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:47:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2025-01-09 12:47:41,024 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 123 [2025-01-09 12:47:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2025-01-09 12:47:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:47:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2025-01-09 12:47:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:47:41,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:41,028 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:41,034 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-01-09 12:47:41,233 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-01-09 12:47:41,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:41,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1595041449, now seen corresponding path program 1 times [2025-01-09 12:47:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110293548] [2025-01-09 12:47:41,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:41,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:47:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:47:41,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:41,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:47:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110293548] [2025-01-09 12:47:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110293548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:47:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979813058] [2025-01-09 12:47:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:47:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:50,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:47:50,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:47:50,459 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:47:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:53,475 INFO L93 Difference]: Finished difference Result 141 states and 206 transitions. [2025-01-09 12:47:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:47:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2025-01-09 12:47:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:53,477 INFO L225 Difference]: With dead ends: 141 [2025-01-09 12:47:53,477 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 12:47:53,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:53,478 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:53,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 361 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:47:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 12:47:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2025-01-09 12:47:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:47:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2025-01-09 12:47:53,496 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 123 [2025-01-09 12:47:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2025-01-09 12:47:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:47:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2025-01-09 12:47:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:47:53,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:53,499 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:47:53,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1652299751, now seen corresponding path program 1 times [2025-01-09 12:47:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915607540] [2025-01-09 12:47:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:53,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:47:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:47:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:48:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:48:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915607540] [2025-01-09 12:48:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915607540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:48:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:48:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:48:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140322089] [2025-01-09 12:48:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:48:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:48:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:48:08,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:48:08,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:48:08,733 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:48:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:12,933 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2025-01-09 12:48:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:48:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2025-01-09 12:48:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:12,936 INFO L225 Difference]: With dead ends: 100 [2025-01-09 12:48:12,936 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 12:48:12,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:48:12,937 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:48:12,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 398 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 12:48:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 12:48:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2025-01-09 12:48:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:48:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2025-01-09 12:48:12,948 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 123 [2025-01-09 12:48:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:12,949 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2025-01-09 12:48:12,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:48:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2025-01-09 12:48:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:48:12,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:12,950 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:48:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:48:12,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1890579221, now seen corresponding path program 1 times [2025-01-09 12:48:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:48:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462652254] [2025-01-09 12:48:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:48:12,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:48:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:48:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:48:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127358590] [2025-01-09 12:48:13,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:13,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:48:13,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:48:13,007 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-01-09 12:48:13,009 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-01-09 12:48:13,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:48:13,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:48:13,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:13,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:48:13,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:48:13,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:48:13,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:48:13,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:13,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:48:13,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:48:13,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:48:13,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:48:13,152 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-01-09 12:48:13,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:48:13,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 12:48:13,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:48:13,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:48:13 BoogieIcfgContainer [2025-01-09 12:48:13,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:48:13,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:48:13,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:48:13,426 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:48:13,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:40" (3/4) ... [2025-01-09 12:48:13,429 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:48:13,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:48:13,430 INFO L158 Benchmark]: Toolchain (without parser) took 33523.59ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 106.0MB in the beginning and 468.6MB in the end (delta: -362.6MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2025-01-09 12:48:13,430 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.52ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: Boogie Preprocessor took 47.61ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: RCFGBuilder took 292.33ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: TraceAbstraction took 32961.07ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 74.2MB in the beginning and 468.8MB in the end (delta: -394.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-01-09 12:48:13,431 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 604.0MB. Free memory was 468.8MB in the beginning and 468.6MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:13,433 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.52ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.61ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 292.33ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32961.07ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 74.2MB in the beginning and 468.8MB in the end (delta: -394.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 604.0MB. Free memory was 468.8MB in the beginning and 468.6MB in the end (delta: 138.5kB). 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 someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed long int var_1_2 = 49; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 64; [L26] signed short int var_1_5 = 1; [L27] signed long int var_1_6 = 8; [L28] signed long int var_1_7 = 0; [L29] signed short int var_1_8 = -4; [L30] unsigned long int var_1_9 = 64; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 10; [L33] signed short int var_1_12 = 100; [L34] signed short int var_1_14 = 128; [L35] signed short int var_1_15 = 10; VAL [isInitial=0, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=49, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L107] isInitial = 1 [L108] FCALL initially() [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L70] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L71] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L71] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L72] var_1_3 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L74] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L74] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L75] var_1_4 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L76] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L77] CALL assume_abort_if_not(var_1_4 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L77] RET assume_abort_if_not(var_1_4 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L78] var_1_6 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L79] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L80] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L81] var_1_7 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L82] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L83] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L83] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L84] var_1_8 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L85] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L86] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L86] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L87] var_1_10 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L89] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L89] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L90] var_1_11 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L92] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L92] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L93] var_1_14 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L94] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L95] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L95] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L96] var_1_15 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L97] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L98] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L98] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_2 >= 50.4f) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L42] COND FALSE !(var_1_3 == (var_1_1 * var_1_4)) [L49] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L51] COND FALSE !(! (var_1_4 < var_1_3)) [L54] var_1_9 = ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L56] COND FALSE !(var_1_10 > var_1_9) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((var_1_2 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) && ((var_1_3 == (var_1_1 * var_1_4)) ? ((var_1_2 >= (var_1_6 + var_1_7)) ? (var_1_5 == ((signed short int) var_1_8)) : (var_1_5 == ((signed short int) 32))) : (var_1_5 == ((signed short int) var_1_8)))) && ((! (var_1_4 < var_1_3)) ? (var_1_9 == ((unsigned long int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_9 == ((unsigned long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))))) && ((var_1_10 > var_1_9) ? ((63.1 >= var_1_7) ? ((var_1_7 >= var_1_2) ? (var_1_12 == ((signed short int) (var_1_14 - var_1_15))) : (var_1_12 == ((signed short int) var_1_14))) : 1) : (var_1_12 == ((signed short int) var_1_15))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=100000001, var_1_4=44, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 243 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3002/3040 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-01-09 12:48:13,464 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_floatingpointinfluence_no-floats_file-91.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 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:48:15,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:48:15,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:48:15,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:48:15,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:48:15,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:48:15,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:48:15,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:48:15,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:48:15,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:48:15,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:48:15,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:48:15,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:48:15,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:48:15,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:48:15,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:48:15,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:48:15,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:48:15,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:48:15,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:48:15,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:48:15,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:48:15,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:48:15,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:48:15,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:48:15,313 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 -> 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 [2025-01-09 12:48:15,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:48:15,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:48:15,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:48:15,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:48:15,574 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:48:15,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:48:16,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/322b1fa1a/98e970c55ed7408a90ba63df24d89473/FLAGb1a5387cc [2025-01-09 12:48:16,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:48:16,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:48:16,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/322b1fa1a/98e970c55ed7408a90ba63df24d89473/FLAGb1a5387cc [2025-01-09 12:48:16,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/322b1fa1a/98e970c55ed7408a90ba63df24d89473 [2025-01-09 12:48:16,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:48:16,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:48:16,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:48:16,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:48:16,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:48:16,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:48:16" (1/1) ... [2025-01-09 12:48:16,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45765e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:16, skipping insertion in model container [2025-01-09 12:48:16,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:48:16" (1/1) ... [2025-01-09 12:48:16,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:48:17,030 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_floatingpointinfluence_no-floats_file-91.i[916,929] [2025-01-09 12:48:17,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:48:17,086 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:48:17,097 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_floatingpointinfluence_no-floats_file-91.i[916,929] [2025-01-09 12:48:17,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:48:17,124 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:48:17,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17 WrapperNode [2025-01-09 12:48:17,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:48:17,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:48:17,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:48:17,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:48:17,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,161 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 12:48:17,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:48:17,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:48:17,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:48:17,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:48:17,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,188 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-01-09 12:48:17,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:48:17,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:48:17,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:48:17,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:48:17,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (1/1) ... [2025-01-09 12:48:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:48:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:48:17,246 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-01-09 12:48:17,249 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-01-09 12:48:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:48:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:48:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:48:17,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:48:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:48:17,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:48:17,323 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:48:17,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:48:18,524 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 12:48:18,524 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:48:18,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:48:18,530 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:48:18,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:48:18 BoogieIcfgContainer [2025-01-09 12:48:18,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:48:18,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:48:18,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:48:18,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:48:18,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:48:16" (1/3) ... [2025-01-09 12:48:18,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b69fefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:48:18, skipping insertion in model container [2025-01-09 12:48:18,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:48:17" (2/3) ... [2025-01-09 12:48:18,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b69fefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:48:18, skipping insertion in model container [2025-01-09 12:48:18,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:48:18" (3/3) ... [2025-01-09 12:48:18,537 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-91.i [2025-01-09 12:48:18,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:48:18,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-91.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:48:18,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:48:18,600 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;@2d99f5fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:48:18,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:48:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:48:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:48:18,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:18,609 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:48:18,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 758919511, now seen corresponding path program 1 times [2025-01-09 12:48:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:48:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106574743] [2025-01-09 12:48:18,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:18,622 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-01-09 12:48:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:48:18,624 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-01-09 12:48:18,625 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-01-09 12:48:18,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:48:18,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:48:18,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:18,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:18,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:48:18,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:48:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 12:48:18,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:48:18,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:48:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106574743] [2025-01-09 12:48:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106574743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:48:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:48:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:48:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618410362] [2025-01-09 12:48:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:48:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:48:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:48:18,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:48:18,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:48:18,824 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:48:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:18,839 INFO L93 Difference]: Finished difference Result 104 states and 181 transitions. [2025-01-09 12:48:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:48:18,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-01-09 12:48:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:18,854 INFO L225 Difference]: With dead ends: 104 [2025-01-09 12:48:18,854 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 12:48:18,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-01-09 12:48:18,857 INFO L435 NwaCegarLoop]: 78 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, 78 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-01-09 12:48:18,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:48:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 12:48:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 12:48:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:48:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2025-01-09 12:48:18,886 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 123 [2025-01-09 12:48:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:18,886 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2025-01-09 12:48:18,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:48:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2025-01-09 12:48:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:48:18,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:18,890 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:48:18,896 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-01-09 12:48:19,091 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-01-09 12:48:19,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:19,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1595041449, now seen corresponding path program 1 times [2025-01-09 12:48:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:48:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152407176] [2025-01-09 12:48:19,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:19,093 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-01-09 12:48:19,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:48:19,095 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-01-09 12:48:19,096 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-01-09 12:48:19,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:48:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:48:19,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:19,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:19,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:48:19,216 INFO L279 TraceCheckSpWp]: Computing forward predicates...