./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd --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 fefe6adca17873d5d34dd1404b78c8b3fa2b7a573a407d59a811f210660977fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:49:13,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:49:14,024 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:49:14,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:49:14,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:49:14,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:49:14,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:49:14,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:49:14,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:49:14,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:49:14,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:49:14,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:49:14,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:49:14,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:49:14,090 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:49:14,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:49:14,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:49:14,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:49:14,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:49:14,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:49:14,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:49:14,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:49:14,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:49:14,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:49:14,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:49:14,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:49:14,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:14,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:49:14,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:49:14,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:49:14,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:49:14,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:49:14,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:49:14,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:49:14,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:49:14,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:49:14,097 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd 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 -> fefe6adca17873d5d34dd1404b78c8b3fa2b7a573a407d59a811f210660977fc [2024-11-13 15:49:14,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:49:14,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:49:14,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:49:14,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:49:14,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:49:14,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i Unable to find full path for "g++" [2024-11-13 15:49:16,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:49:16,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:49:16,815 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i [2024-11-13 15:49:16,833 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/a1af671bc/0d6f065c04bc4132928561770b788343/FLAG1d6a3abfd [2024-11-13 15:49:16,872 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/a1af671bc/0d6f065c04bc4132928561770b788343 [2024-11-13 15:49:16,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:49:16,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:49:16,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:16,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:49:16,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:49:16,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:16" (1/1) ... [2024-11-13 15:49:16,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84824a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:16, skipping insertion in model container [2024-11-13 15:49:16,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:16" (1/1) ... [2024-11-13 15:49:16,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:49:17,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i[915,928] [2024-11-13 15:49:17,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:17,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:49:17,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i[915,928] [2024-11-13 15:49:17,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:17,358 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:49:17,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17 WrapperNode [2024-11-13 15:49:17,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:17,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:17,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:49:17,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:49:17,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,455 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-13 15:49:17,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:17,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:49:17,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:49:17,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:49:17,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,499 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:49:17,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:49:17,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:49:17,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:49:17,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:49:17,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (1/1) ... [2024-11-13 15:49:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:17,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:17,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:49:17,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:49:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:49:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:49:17,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:49:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:49:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:49:17,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:49:17,743 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:49:17,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:49:18,274 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 15:49:18,275 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:49:18,295 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:49:18,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:49:18,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:18 BoogieIcfgContainer [2024-11-13 15:49:18,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:49:18,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:49:18,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:49:18,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:49:18,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:49:16" (1/3) ... [2024-11-13 15:49:18,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230972a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:18, skipping insertion in model container [2024-11-13 15:49:18,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:17" (2/3) ... [2024-11-13 15:49:18,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230972a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:18, skipping insertion in model container [2024-11-13 15:49:18,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:18" (3/3) ... [2024-11-13 15:49:18,313 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-46.i [2024-11-13 15:49:18,333 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:49:18,335 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-46.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:49:18,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:49:18,475 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e6a7cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:49:18,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:49:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 15:49:18,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:18,499 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:18,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:18,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash 121174595, now seen corresponding path program 1 times [2024-11-13 15:49:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089246579] [2024-11-13 15:49:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:49:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:49:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:49:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:49:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:49:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:49:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:49:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:49:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:49:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:49:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:49:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:49:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:49:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089246579] [2024-11-13 15:49:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089246579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:18,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:18,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809524280] [2024-11-13 15:49:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:49:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:49:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:49:19,015 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:19,059 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2024-11-13 15:49:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:49:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2024-11-13 15:49:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:19,071 INFO L225 Difference]: With dead ends: 137 [2024-11-13 15:49:19,072 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 15:49:19,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:49:19,078 INFO L432 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:19,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 15:49:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 15:49:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-13 15:49:19,150 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 125 [2024-11-13 15:49:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:19,153 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-13 15:49:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-13 15:49:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 15:49:19,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:19,159 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:19,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:49:19,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:19,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 582050753, now seen corresponding path program 1 times [2024-11-13 15:49:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:19,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747043708] [2024-11-13 15:49:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:49:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:49:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:49:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:49:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:49:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:49:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:49:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:49:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:49:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:49:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:49:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:49:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:49:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747043708] [2024-11-13 15:49:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747043708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:49:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296746218] [2024-11-13 15:49:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:45,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:45,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:45,600 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:52,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 15:49:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:54,297 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2024-11-13 15:49:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-13 15:49:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:54,300 INFO L225 Difference]: With dead ends: 232 [2024-11-13 15:49:54,300 INFO L226 Difference]: Without dead ends: 167 [2024-11-13 15:49:54,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:54,301 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 213 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:54,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 365 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-13 15:49:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-13 15:49:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 127. [2024-11-13 15:49:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 97 states have internal predecessors, (134), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 15:49:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2024-11-13 15:49:54,323 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 126 [2024-11-13 15:49:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:54,324 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2024-11-13 15:49:54,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2024-11-13 15:49:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 15:49:54,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:54,327 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:49:54,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -697812925, now seen corresponding path program 1 times [2024-11-13 15:49:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751143383] [2024-11-13 15:49:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:49:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706693777] [2024-11-13 15:49:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:54,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:54,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:54,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:54,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:49:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:49:54,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:49:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:49:54,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:49:54,924 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:49:54,925 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:49:54,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:55,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:55,134 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 15:49:55,251 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:49:55,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:49:55 BoogieIcfgContainer [2024-11-13 15:49:55,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:49:55,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:49:55,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:49:55,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:49:55,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:18" (3/4) ... [2024-11-13 15:49:55,259 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:49:55,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:49:55,261 INFO L158 Benchmark]: Toolchain (without parser) took 38384.20ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 94.8MB in the beginning and 334.8MB in the end (delta: -240.0MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,262 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:49:55,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.62ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 80.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.67ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 75.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,262 INFO L158 Benchmark]: Boogie Preprocessor took 93.95ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 69.6MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,263 INFO L158 Benchmark]: RCFGBuilder took 745.07ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 43.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,263 INFO L158 Benchmark]: TraceAbstraction took 36955.11ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 42.9MB in the beginning and 334.8MB in the end (delta: -292.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-13 15:49:55,263 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 427.8MB. Free memory was 334.8MB in the beginning and 334.8MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:49:55,265 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.32ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.62ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 80.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.67ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 75.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.95ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 69.6MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 745.07ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 43.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36955.11ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 42.9MB in the beginning and 334.8MB in the end (delta: -292.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 427.8MB. Free memory was 334.8MB in the beginning and 334.8MB in the end (delta: 56.6kB). 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 109, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned short int last_1_var_1_13 = 8; [L41] double last_1_var_1_17 = 127.5; VAL [isInitial=0, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L121] last_1_var_1_13 = var_1_13 [L122] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L107] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L109] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L110] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L110] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L111] var_1_14 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L113] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L113] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L114] var_1_15 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L116] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L117] var_1_18 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L118] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L133] RET updateVariables() [L134] CALL step() [L45] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L48] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L52] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L53] COND TRUE var_1_2 && stepLocal_0 [L54] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L58] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L65] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L67] var_1_17 = var_1_18 [L68] var_1_19 = 5 [L69] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L70] COND FALSE !(var_1_1 < var_1_20) [L77] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L79] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L79] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L79] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L86] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L125-L126] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 226 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:49:55,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd --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 fefe6adca17873d5d34dd1404b78c8b3fa2b7a573a407d59a811f210660977fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:49:57,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:49:58,033 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:49:58,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:49:58,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:49:58,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:49:58,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:49:58,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:49:58,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:49:58,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:49:58,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:49:58,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:49:58,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:49:58,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:49:58,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:49:58,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:49:58,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:49:58,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:49:58,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:49:58,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:49:58,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:49:58,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:49:58,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:58,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:49:58,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:49:58,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:49:58,080 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd 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 -> fefe6adca17873d5d34dd1404b78c8b3fa2b7a573a407d59a811f210660977fc [2024-11-13 15:49:58,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:49:58,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:49:58,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:49:58,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:49:58,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:49:58,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i Unable to find full path for "g++" [2024-11-13 15:50:00,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:50:00,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:50:00,770 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i [2024-11-13 15:50:00,783 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/945e0a396/c03239d04e584a3098bf125a00c694cf/FLAG8d6a73e7e [2024-11-13 15:50:00,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/data/945e0a396/c03239d04e584a3098bf125a00c694cf [2024-11-13 15:50:00,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:50:00,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:50:00,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:50:00,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:50:00,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:50:00,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:50:00" (1/1) ... [2024-11-13 15:50:00,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5124355f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:00, skipping insertion in model container [2024-11-13 15:50:00,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:50:00" (1/1) ... [2024-11-13 15:50:00,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:50:01,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i[915,928] [2024-11-13 15:50:01,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:50:01,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:50:01,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-46.i[915,928] [2024-11-13 15:50:01,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:50:01,245 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:50:01,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01 WrapperNode [2024-11-13 15:50:01,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:50:01,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:50:01,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:50:01,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:50:01,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,307 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-13 15:50:01,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:50:01,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:50:01,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:50:01,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:50:01,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,338 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:50:01,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:50:01,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:50:01,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:50:01,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:50:01,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (1/1) ... [2024-11-13 15:50:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:50:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:01,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:50:01,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:50:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:50:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:50:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:50:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:50:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:50:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:50:01,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:50:01,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:50:14,300 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 15:50:14,301 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:50:14,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:50:14,316 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:50:14,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:50:14 BoogieIcfgContainer [2024-11-13 15:50:14,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:50:14,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:50:14,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:50:14,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:50:14,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:50:00" (1/3) ... [2024-11-13 15:50:14,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af7f304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:50:14, skipping insertion in model container [2024-11-13 15:50:14,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:50:01" (2/3) ... [2024-11-13 15:50:14,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af7f304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:50:14, skipping insertion in model container [2024-11-13 15:50:14,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:50:14" (3/3) ... [2024-11-13 15:50:14,334 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-46.i [2024-11-13 15:50:14,370 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:50:14,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-46.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:50:14,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:50:14,465 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;@5d03bb3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:50:14,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:50:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:50:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 15:50:14,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:14,486 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:14,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1511147600, now seen corresponding path program 1 times [2024-11-13 15:50:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:50:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420351545] [2024-11-13 15:50:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:14,507 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 [2024-11-13 15:50:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:50:14,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:50:14,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:50:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:50:15,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:50:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 15:50:15,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:50:15,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:50:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420351545] [2024-11-13 15:50:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420351545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:15,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:50:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279699856] [2024-11-13 15:50:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:15,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:50:15,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:50:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:50:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:50:15,672 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:15,712 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2024-11-13 15:50:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:50:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-11-13 15:50:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:15,722 INFO L225 Difference]: With dead ends: 110 [2024-11-13 15:50:15,722 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 15:50:15,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:50:15,734 INFO L432 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 [2024-11-13 15:50:15,735 INFO L433 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] [2024-11-13 15:50:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 15:50:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 15:50:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:50:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-13 15:50:15,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 121 [2024-11-13 15:50:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-13 15:50:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-13 15:50:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:50:15,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:15,803 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:15,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 15:50:16,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:50:16,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:16,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1552327862, now seen corresponding path program 1 times [2024-11-13 15:50:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:50:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465721934] [2024-11-13 15:50:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:16,009 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 [2024-11-13 15:50:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:50:16,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:50:16,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:51:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:40,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:51:40,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:56,758 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:52:00,831 WARN L851 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from false [2024-11-13 15:52:04,890 WARN L873 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from true [2024-11-13 15:52:17,086 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:52:29,328 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:52:41,579 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:52:53,840 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:06,103 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:17,047 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:29,307 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:41,585 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:53,863 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:53:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:53:53,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:53:53,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465721934] [2024-11-13 15:53:53,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465721934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:53,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613324337] [2024-11-13 15:53:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:53,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2024-11-13 15:53:53,870 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:53:58,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:02,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)))) (and (= c_~var_1_17~0 .cse0) (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) (= c_~last_1_var_1_17~0 .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 15:54:06,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:11,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:15,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:19,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:22,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:26,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:30,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:35,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:39,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:39,083 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2024-11-13 15:54:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-13 15:54:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:39,187 INFO L225 Difference]: With dead ends: 117 [2024-11-13 15:54:39,187 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 15:54:39,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2024-11-13 15:54:39,189 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 39 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:39,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 237 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 14 Invalid, 9 Unknown, 196 Unchecked, 40.9s Time] [2024-11-13 15:54:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 15:54:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2024-11-13 15:54:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 15:54:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-11-13 15:54:39,219 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 122 [2024-11-13 15:54:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:39,220 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-11-13 15:54:39,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:54:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-11-13 15:54:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:54:39,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:39,223 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:39,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 15:54:39,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:54:39,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:54:39,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -872269492, now seen corresponding path program 1 times [2024-11-13 15:54:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:54:39,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602184349] [2024-11-13 15:54:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:39,426 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 [2024-11-13 15:54:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:54:39,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:54:39,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 (4)] Waiting until timeout for monitored process [2024-11-13 15:56:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:56:53,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:56:53,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:57:09,764 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:57:13,848 WARN L851 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from false [2024-11-13 15:57:17,909 WARN L873 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from true [2024-11-13 15:57:30,175 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:57:42,148 WARN L286 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:57:54,413 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:06,681 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:18,946 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:31,245 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:41,351 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:53,692 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:58:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:58:59,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:58:59,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:58:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602184349] [2024-11-13 15:58:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602184349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:59,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:59,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:58:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016489937] [2024-11-13 15:58:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:59,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:58:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:58:59,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:58:59,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2024-11-13 15:58:59,192 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:59:03,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:08,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)))) (and (= c_~var_1_17~0 .cse0) (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) (= c_~last_1_var_1_17~0 .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 15:59:11,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:15,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:19,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:23,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:27,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:32,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:36,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:40,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:44,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:59:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:44,824 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2024-11-13 15:59:44,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:59:44,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-13 15:59:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:44,945 INFO L225 Difference]: With dead ends: 124 [2024-11-13 15:59:44,945 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 15:59:44,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2024-11-13 15:59:44,947 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 39 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 41.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:44,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 232 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 14 Invalid, 9 Unknown, 193 Unchecked, 41.3s Time] [2024-11-13 15:59:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 15:59:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2024-11-13 15:59:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 15:59:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-11-13 15:59:44,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 122 [2024-11-13 15:59:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:44,971 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-11-13 15:59:44,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:59:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-11-13 15:59:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:59:44,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:44,978 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:45,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 (4)] Ended with exit code 0 [2024-11-13 15:59:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:59:45,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -851263284, now seen corresponding path program 1 times [2024-11-13 15:59:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:59:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734582650] [2024-11-13 15:59:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:45,180 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 [2024-11-13 15:59:45,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:59:45,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:59:45,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3cff47-9170-4fb8-b00d-4d23c3838ef5/bin/uautomizer-verify-qhAvR1uOyd/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 (5)] Waiting until timeout for monitored process [2024-11-13 15:59:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:46,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 15:59:46,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:59:56,945 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:05,315 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:13,674 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:22,013 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:30,404 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:38,788 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:00:42,917 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 16:00:47,048 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 16:00:55,292 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:03,693 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:12,078 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:20,461 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:28,895 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:37,290 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:45,530 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:01:53,858 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:02,233 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:10,576 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:18,976 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:27,327 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:35,663 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:02:39,784 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg ((_ zero_extend 24) c_~var_1_5~0)))) c_~var_1_1~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 16:02:43,909 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg ((_ zero_extend 24) c_~var_1_5~0)))) c_~var_1_1~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 16:02:52,353 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:00,571 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:08,929 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:17,250 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:25,580 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:33,968 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:42,380 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:50,758 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:03:59,158 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:04:03,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_4~0)) (.cse1 ((_ zero_extend 24) c_~var_1_5~0))) (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (= ((_ zero_extend 8) c_~var_1_5~0) c_~var_1_6~0) (= ((_ extract 7 0) (bvadd .cse0 (bvneg .cse1))) c_~var_1_1~0) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (not (bvsle ((_ zero_extend 24) c_~var_1_1~0) (bvmul .cse0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 16:04:07,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_4~0)) (.cse1 ((_ zero_extend 24) c_~var_1_5~0))) (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (= ((_ zero_extend 8) c_~var_1_5~0) c_~var_1_6~0) (= ((_ extract 7 0) (bvadd .cse0 (bvneg .cse1))) c_~var_1_1~0) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (not (bvsle ((_ zero_extend 24) c_~var_1_1~0) (bvmul .cse0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 16:04:15,803 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:04:24,073 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)