./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB --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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:24:38,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:24:38,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:24:38,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:24:38,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:24:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:24:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:24:39,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:24:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:24:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:24:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:24:39,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:24:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:24:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:24:39,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:24:39,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:24:39,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:24:39,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:39,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:39,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:24:39,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:39,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:39,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:39,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:39,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:24:39,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:24:39,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:24:39,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:24:39,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:24:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:24:39,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:24:39,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:24:39,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:24:39,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:24:39,036 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_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-28 05:24:39,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:24:39,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:24:39,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:24:39,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:24:39,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:24:39,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-28 05:24:43,241 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/60a82263c/73e42ecf893c4c4ab95b17b437f601ae/FLAG2dfac3587 [2024-11-28 05:24:43,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:24:43,556 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-28 05:24:43,566 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/60a82263c/73e42ecf893c4c4ab95b17b437f601ae/FLAG2dfac3587 [2024-11-28 05:24:43,590 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/60a82263c/73e42ecf893c4c4ab95b17b437f601ae [2024-11-28 05:24:43,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:24:43,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:24:43,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:43,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:24:43,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:24:43,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:43,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd4ece1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43, skipping insertion in model container [2024-11-28 05:24:43,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:43,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:24:43,827 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_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-28 05:24:43,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:43,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:24:43,928 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_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-28 05:24:43,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:43,984 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:24:43,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43 WrapperNode [2024-11-28 05:24:43,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:43,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:43,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:24:43,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:24:43,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,079 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-28 05:24:44,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:44,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:24:44,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:24:44,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:24:44,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,122 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-28 05:24:44,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:24:44,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:24:44,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:24:44,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:24:44,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (1/1) ... [2024-11-28 05:24:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:44,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:44,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:24:44,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:24:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:24:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 05:24:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 05:24:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:24:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:24:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:24:44,367 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:24:44,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:24:44,833 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 05:24:44,833 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:24:44,855 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:24:44,858 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:24:44,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:44 BoogieIcfgContainer [2024-11-28 05:24:44,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:24:44,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:24:44,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:24:44,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:24:44,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:43" (1/3) ... [2024-11-28 05:24:44,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c538a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:44, skipping insertion in model container [2024-11-28 05:24:44,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:43" (2/3) ... [2024-11-28 05:24:44,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c538a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:44, skipping insertion in model container [2024-11-28 05:24:44,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:44" (3/3) ... [2024-11-28 05:24:44,874 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-28 05:24:44,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:24:44,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-29.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:24:44,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:24:44,985 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;@27f2eebf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:24:44,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:24:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-28 05:24:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-28 05:24:45,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:45,013 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:24:45,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:24:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2024-11-28 05:24:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748558032] [2024-11-28 05:24:45,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-28 05:24:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748558032] [2024-11-28 05:24:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748558032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:46,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:24:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464343004] [2024-11-28 05:24:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:46,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:24:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:46,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:24:46,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:24:46,353 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:24:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:46,438 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2024-11-28 05:24:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:24:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-28 05:24:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:46,455 INFO L225 Difference]: With dead ends: 202 [2024-11-28 05:24:46,455 INFO L226 Difference]: Without dead ends: 133 [2024-11-28 05:24:46,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:24:46,468 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:46,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:24:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-28 05:24:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-28 05:24:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 05:24:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-28 05:24:46,574 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-28 05:24:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:46,581 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-28 05:24:46,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:24:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-28 05:24:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-28 05:24:46,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:46,590 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:24:46,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:24:46,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:24:46,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2024-11-28 05:24:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123791504] [2024-11-28 05:24:46,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-28 05:24:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123791504] [2024-11-28 05:24:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123791504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:24:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84011356] [2024-11-28 05:24:47,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:47,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:24:47,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:24:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:47,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 05:24:47,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:24:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-28 05:24:48,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:24:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-28 05:24:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84011356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:24:48,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:24:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-28 05:24:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175367359] [2024-11-28 05:24:48,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:24:48,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:24:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:48,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:24:48,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:24:48,819 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-28 05:24:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:49,363 INFO L93 Difference]: Finished difference Result 271 states and 417 transitions. [2024-11-28 05:24:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:24:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) Word has length 170 [2024-11-28 05:24:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:49,371 INFO L225 Difference]: With dead ends: 271 [2024-11-28 05:24:49,371 INFO L226 Difference]: Without dead ends: 143 [2024-11-28 05:24:49,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:24:49,377 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 132 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:49,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 184 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:24:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-28 05:24:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2024-11-28 05:24:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 05:24:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 209 transitions. [2024-11-28 05:24:49,452 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 209 transitions. Word has length 170 [2024-11-28 05:24:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 209 transitions. [2024-11-28 05:24:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-28 05:24:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 209 transitions. [2024-11-28 05:24:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-28 05:24:49,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:49,462 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:24:49,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:24:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:49,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:24:49,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash 158292725, now seen corresponding path program 1 times [2024-11-28 05:24:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:49,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854499043] [2024-11-28 05:24:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 05:24:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908832910] [2024-11-28 05:24:49,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:49,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:49,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:24:49,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:24:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:24:50,106 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:24:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:24:50,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 05:24:50,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:24:50,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 05:24:50,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:24:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:50,581 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-28 05:24:50,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:24:50,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:50 BoogieIcfgContainer [2024-11-28 05:24:50,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:24:50,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:24:50,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:24:50,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:24:50,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:44" (3/4) ... [2024-11-28 05:24:50,780 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:24:50,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:24:50,782 INFO L158 Benchmark]: Toolchain (without parser) took 7185.66ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 71.5MB in the end (delta: 20.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-28 05:24:50,783 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:24:50,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.81ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:24:50,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.37ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:24:50,786 INFO L158 Benchmark]: Boogie Preprocessor took 73.78ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:24:50,787 INFO L158 Benchmark]: RCFGBuilder took 703.69ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 55.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:24:50,787 INFO L158 Benchmark]: TraceAbstraction took 5910.83ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 71.5MB in the end (delta: -16.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-28 05:24:50,788 INFO L158 Benchmark]: Witness Printer took 6.54ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 71.5MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:24:50,790 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.81ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.37ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.78ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 703.69ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 55.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5910.83ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 71.5MB in the end (delta: -16.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 6.54ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 71.5MB in the end (delta: 21.1kB). 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 135, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L95] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L143] RET updateVariables() [L144] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L49] COND TRUE var_1_10 <= var_1_17 [L50] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L73] COND TRUE \read(var_1_1) [L74] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 170 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345 SizeOfPredicates, 3 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6012/6048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 05:24:50,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB --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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:24:54,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:24:54,319 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 05:24:54,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:24:54,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:24:54,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:24:54,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:24:54,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:24:54,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:24:54,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:24:54,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:24:54,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:24:54,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:24:54,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:24:54,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:24:54,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:24:54,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:24:54,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:24:54,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:24:54,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:24:54,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:24:54,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:54,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:54,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:54,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:54,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:24:54,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:24:54,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:24:54,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:24:54,369 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:24:54,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:24:54,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:24:54,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:24:54,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:24:54,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:24:54,370 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_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-28 05:24:54,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:24:54,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:24:54,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:24:54,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:24:54,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:24:54,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-28 05:24:58,440 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/df3ee980d/fb6b5c55f68a402bbbee38912a977fab/FLAG3d7d0f50f [2024-11-28 05:24:58,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:24:58,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-28 05:24:58,821 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/df3ee980d/fb6b5c55f68a402bbbee38912a977fab/FLAG3d7d0f50f [2024-11-28 05:24:58,849 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/data/df3ee980d/fb6b5c55f68a402bbbee38912a977fab [2024-11-28 05:24:58,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:24:58,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:24:58,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:58,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:24:58,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:24:58,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:58" (1/1) ... [2024-11-28 05:24:58,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c09d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:58, skipping insertion in model container [2024-11-28 05:24:58,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:58" (1/1) ... [2024-11-28 05:24:58,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:24:59,119 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_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-28 05:24:59,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:59,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:24:59,260 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_2545b523-31dd-47e0-99b5-099bb4c93c52/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-28 05:24:59,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:59,373 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:24:59,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59 WrapperNode [2024-11-28 05:24:59,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:59,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:59,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:24:59,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:24:59,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,428 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-28 05:24:59,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:59,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:24:59,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:24:59,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:24:59,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,478 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-28 05:24:59,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:24:59,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:24:59,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:24:59,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:24:59,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (1/1) ... [2024-11-28 05:24:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:59,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:24:59,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:24:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:24:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:24:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 05:24:59,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 05:24:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:24:59,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:24:59,723 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:24:59,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:25:02,722 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 05:25:02,722 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:25:02,738 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:25:02,738 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:25:02,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:02 BoogieIcfgContainer [2024-11-28 05:25:02,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:25:02,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:25:02,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:25:02,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:25:02,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:58" (1/3) ... [2024-11-28 05:25:02,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b301ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:02, skipping insertion in model container [2024-11-28 05:25:02,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:59" (2/3) ... [2024-11-28 05:25:02,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b301ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:02, skipping insertion in model container [2024-11-28 05:25:02,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:02" (3/3) ... [2024-11-28 05:25:02,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-28 05:25:02,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:25:02,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-29.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:25:02,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:25:02,881 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;@3c5a4324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:25:02,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:25:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-28 05:25:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-28 05:25:02,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:02,902 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:25:02,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:02,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2024-11-28 05:25:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:25:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212235630] [2024-11-28 05:25:02,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:02,925 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-28 05:25:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:25:02,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:02,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:03,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:25:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-28 05:25:03,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:04,016 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:25:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212235630] [2024-11-28 05:25:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212235630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [343758465] [2024-11-28 05:25:04,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:04,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:25:04,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:25:04,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:25:04,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-28 05:25:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:04,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:25:04,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-28 05:25:05,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:25:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [343758465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:25:05,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-28 05:25:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807579092] [2024-11-28 05:25:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:05,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:25:05,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:05,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:05,936 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:25:08,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:25:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:08,045 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2024-11-28 05:25:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-28 05:25:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:08,075 INFO L225 Difference]: With dead ends: 202 [2024-11-28 05:25:08,075 INFO L226 Difference]: Without dead ends: 133 [2024-11-28 05:25:08,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:08,083 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:08,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 05:25:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-28 05:25:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-28 05:25:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 05:25:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-28 05:25:08,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-28 05:25:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:08,211 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-28 05:25:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:25:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-28 05:25:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-28 05:25:08,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:08,220 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:25:08,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-28 05:25:08,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-28 05:25:08,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:25:08,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2024-11-28 05:25:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:25:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65117642] [2024-11-28 05:25:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:08,625 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-28 05:25:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:25:08,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:08,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:09,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:25:09,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-28 05:25:09,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:09,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:25:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65117642] [2024-11-28 05:25:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65117642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [287306168] [2024-11-28 05:25:09,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:25:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:25:09,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:25:09,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-28 05:25:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:10,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:25:10,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-28 05:25:10,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:25:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [287306168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:25:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-28 05:25:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463376343] [2024-11-28 05:25:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:10,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:25:10,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:10,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:10,629 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:25:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:13,090 INFO L93 Difference]: Finished difference Result 385 states and 605 transitions. [2024-11-28 05:25:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-28 05:25:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:13,098 INFO L225 Difference]: With dead ends: 385 [2024-11-28 05:25:13,099 INFO L226 Difference]: Without dead ends: 257 [2024-11-28 05:25:13,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:13,103 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 95 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:13,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 05:25:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-28 05:25:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-28 05:25:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-28 05:25:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 398 transitions. [2024-11-28 05:25:13,179 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 398 transitions. Word has length 170 [2024-11-28 05:25:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 398 transitions. [2024-11-28 05:25:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-28 05:25:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 398 transitions. [2024-11-28 05:25:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-28 05:25:13,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:13,184 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:25:13,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-28 05:25:13,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:13,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1731312048, now seen corresponding path program 1 times [2024-11-28 05:25:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:25:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260793023] [2024-11-28 05:25:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:13,587 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-28 05:25:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:25:13,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:13,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (6)] Waiting until timeout for monitored process [2024-11-28 05:25:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:14,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:25:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-28 05:25:14,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:14,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:25:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260793023] [2024-11-28 05:25:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260793023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165681956] [2024-11-28 05:25:14,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:14,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:25:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:25:14,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:25:14,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-28 05:25:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:15,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:25:15,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-28 05:25:16,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-28 05:25:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165681956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:17,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-28 05:25:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105362016] [2024-11-28 05:25:17,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:17,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:25:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:25:17,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:25:17,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:25:17,617 INFO L87 Difference]: Start difference. First operand 255 states and 398 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-28 05:25:28,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:25:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:34,172 INFO L93 Difference]: Finished difference Result 701 states and 1052 transitions. [2024-11-28 05:25:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 05:25:34,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 170 [2024-11-28 05:25:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:34,184 INFO L225 Difference]: With dead ends: 701 [2024-11-28 05:25:34,185 INFO L226 Difference]: Without dead ends: 449 [2024-11-28 05:25:34,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-28 05:25:34,188 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 310 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:34,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 316 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2024-11-28 05:25:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-28 05:25:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 291. [2024-11-28 05:25:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 166 states have (on average 1.2048192771084338) internal successors, (200), 166 states have internal predecessors, (200), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-28 05:25:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2024-11-28 05:25:34,306 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 170 [2024-11-28 05:25:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:34,308 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2024-11-28 05:25:34,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-28 05:25:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2024-11-28 05:25:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-28 05:25:34,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:34,317 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:25:34,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (6)] Ended with exit code 0 [2024-11-28 05:25:34,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:25:34,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:25:34,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:34,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1933300087, now seen corresponding path program 1 times [2024-11-28 05:25:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:25:34,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4215147] [2024-11-28 05:25:34,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:34,720 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-28 05:25:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:25:34,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:25:34,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (8)] Waiting until timeout for monitored process [2024-11-28 05:25:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:35,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 05:25:35,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:55,736 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-28 05:26:07,109 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-28 05:26:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-28 05:26:13,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:26:13,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:26:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4215147] [2024-11-28 05:26:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4215147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:26:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:26:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:26:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919251293] [2024-11-28 05:26:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:26:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:26:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:26:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:26:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=89, Unknown=2, NotChecked=42, Total=182 [2024-11-28 05:26:13,581 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-28 05:26:20,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (let ((.cse8 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (fp.geq ~var_1_26~0 .cse6))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (fp.leq ~var_1_25~0 .cse7) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-28 05:26:23,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:26:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:24,744 INFO L93 Difference]: Finished difference Result 747 states and 1079 transitions. [2024-11-28 05:26:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:26:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2024-11-28 05:26:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:24,755 INFO L225 Difference]: With dead ends: 747 [2024-11-28 05:26:24,755 INFO L226 Difference]: Without dead ends: 459 [2024-11-28 05:26:24,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=83, Invalid=136, Unknown=3, NotChecked=84, Total=306 [2024-11-28 05:26:24,759 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 146 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:24,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 453 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 307 Invalid, 0 Unknown, 467 Unchecked, 6.5s Time] [2024-11-28 05:26:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-28 05:26:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 451. [2024-11-28 05:26:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 260 states have (on average 1.2038461538461538) internal successors, (313), 260 states have internal predecessors, (313), 168 states have call successors, (168), 22 states have call predecessors, (168), 22 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-28 05:26:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 649 transitions. [2024-11-28 05:26:24,894 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 649 transitions. Word has length 171 [2024-11-28 05:26:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:24,897 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 649 transitions. [2024-11-28 05:26:24,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-28 05:26:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 649 transitions. [2024-11-28 05:26:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-28 05:26:24,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:24,905 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:26:24,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (8)] Ended with exit code 0 [2024-11-28 05:26:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:26:25,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:26:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1681608839, now seen corresponding path program 1 times [2024-11-28 05:26:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:26:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761418181] [2024-11-28 05:26:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:25,107 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-28 05:26:25,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:26:25,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:26:25,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (9)] Waiting until timeout for monitored process [2024-11-28 05:26:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:25,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 05:26:25,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:46,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2024-11-28 05:26:50,160 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-28 05:27:02,406 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-28 05:27:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-28 05:27:09,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:27:09,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:27:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761418181] [2024-11-28 05:27:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761418181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:27:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:27:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:27:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217097269] [2024-11-28 05:27:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:27:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:27:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:27:09,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:27:09,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=88, Unknown=3, NotChecked=42, Total=182 [2024-11-28 05:27:09,128 INFO L87 Difference]: Start difference. First operand 451 states and 649 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-28 05:28:28,876 WARN L286 SmtUtils]: Spent 57.46s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:29:59,984 WARN L286 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 102 DAG size of output: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:30:04,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:30:08,756 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 [0] [2024-11-28 05:30:12,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:30:16,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:30:20,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:30:20,255 INFO L93 Difference]: Finished difference Result 785 states and 1110 transitions. [2024-11-28 05:30:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:30:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2024-11-28 05:30:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:30:20,297 INFO L225 Difference]: With dead ends: 785 [2024-11-28 05:30:20,297 INFO L226 Difference]: Without dead ends: 497 [2024-11-28 05:30:20,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 183.6s TimeCoverageRelationStatistics Valid=93, Invalid=173, Unknown=14, NotChecked=62, Total=342 [2024-11-28 05:30:20,300 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 140 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:30:20,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 199 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 233 Invalid, 4 Unknown, 234 Unchecked, 21.8s Time] [2024-11-28 05:30:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-28 05:30:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2024-11-28 05:30:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 282 states have (on average 1.1808510638297873) internal successors, (333), 282 states have internal predecessors, (333), 168 states have call successors, (168), 30 states have call predecessors, (168), 30 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-28 05:30:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 669 transitions. [2024-11-28 05:30:20,418 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 669 transitions. Word has length 171 [2024-11-28 05:30:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:30:20,419 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 669 transitions. [2024-11-28 05:30:20,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-28 05:30:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 669 transitions. [2024-11-28 05:30:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-28 05:30:20,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:30:20,422 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:30:20,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:30:20,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:20,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:30:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:30:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 691588410, now seen corresponding path program 1 times [2024-11-28 05:30:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:30:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98782740] [2024-11-28 05:30:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:30:20,625 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-28 05:30:20,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:30:20,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:20,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (10)] Waiting until timeout for monitored process [2024-11-28 05:30:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:30:21,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:30:21,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:30:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-28 05:30:22,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:30:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-28 05:30:23,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:30:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98782740] [2024-11-28 05:30:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98782740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:30:23,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:30:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-28 05:30:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042860063] [2024-11-28 05:30:23,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:30:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:30:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:30:23,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:30:23,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:30:23,441 INFO L87 Difference]: Start difference. First operand 481 states and 669 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-28 05:30:25,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:30:26,696 INFO L93 Difference]: Finished difference Result 1266 states and 1720 transitions. [2024-11-28 05:30:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:30:26,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 172 [2024-11-28 05:30:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:30:26,705 INFO L225 Difference]: With dead ends: 1266 [2024-11-28 05:30:26,705 INFO L226 Difference]: Without dead ends: 788 [2024-11-28 05:30:26,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:30:26,710 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 112 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:30:26,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 241 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 05:30:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-28 05:30:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 505. [2024-11-28 05:30:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 300 states have (on average 1.16) internal successors, (348), 300 states have internal predecessors, (348), 168 states have call successors, (168), 36 states have call predecessors, (168), 36 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-28 05:30:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 684 transitions. [2024-11-28 05:30:26,865 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 684 transitions. Word has length 172 [2024-11-28 05:30:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:30:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 684 transitions. [2024-11-28 05:30:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-28 05:30:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 684 transitions. [2024-11-28 05:30:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-28 05:30:26,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:30:26,870 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:30:26,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (10)] Ended with exit code 0 [2024-11-28 05:30:27,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:27,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:30:27,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:30:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 748846712, now seen corresponding path program 1 times [2024-11-28 05:30:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:30:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864079760] [2024-11-28 05:30:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:30:27,075 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-28 05:30:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:30:27,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:27,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (11)] Waiting until timeout for monitored process [2024-11-28 05:30:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:30:27,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:30:27,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:30:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-28 05:30:29,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:30:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-28 05:30:30,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:30:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864079760] [2024-11-28 05:30:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864079760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:30:30,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:30:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-28 05:30:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371189364] [2024-11-28 05:30:30,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:30:30,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:30:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:30:30,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:30:30,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:30:30,790 INFO L87 Difference]: Start difference. First operand 505 states and 684 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-28 05:30:33,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:30:36,674 INFO L93 Difference]: Finished difference Result 1092 states and 1438 transitions. [2024-11-28 05:30:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 05:30:36,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 172 [2024-11-28 05:30:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:30:36,687 INFO L225 Difference]: With dead ends: 1092 [2024-11-28 05:30:36,687 INFO L226 Difference]: Without dead ends: 590 [2024-11-28 05:30:36,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-11-28 05:30:36,691 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 151 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:30:36,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 497 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 05:30:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-28 05:30:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 553. [2024-11-28 05:30:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 336 states have (on average 1.1160714285714286) internal successors, (375), 336 states have internal predecessors, (375), 168 states have call successors, (168), 48 states have call predecessors, (168), 48 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-28 05:30:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 711 transitions. [2024-11-28 05:30:36,820 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 711 transitions. Word has length 172 [2024-11-28 05:30:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:30:36,821 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 711 transitions. [2024-11-28 05:30:36,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-28 05:30:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 711 transitions. [2024-11-28 05:30:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-28 05:30:36,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:30:36,825 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:30:36,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (11)] Ended with exit code 0 [2024-11-28 05:30:37,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:37,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:30:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:30:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash -60499914, now seen corresponding path program 1 times [2024-11-28 05:30:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:30:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038757418] [2024-11-28 05:30:37,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:30:37,031 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-28 05:30:37,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:30:37,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:30:37,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545b523-31dd-47e0-99b5-099bb4c93c52/bin/uautomizer-verify-aQ6SnzHsRB/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 (12)] Waiting until timeout for monitored process [2024-11-28 05:30:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:30:37,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:30:37,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:31:26,100 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:32:02,281 WARN L286 SmtUtils]: Spent 16.41s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:32:07,397 WARN L286 SmtUtils]: Spent 5.10s 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-28 05:32:12,901 WARN L286 SmtUtils]: Spent 5.50s 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-28 05:32:18,875 WARN L286 SmtUtils]: Spent 5.97s 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-28 05:32:24,227 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:32:46,381 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:32:52,643 WARN L286 SmtUtils]: Spent 6.26s 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-28 05:32:58,273 WARN L286 SmtUtils]: Spent 5.63s 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-28 05:33:09,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 24) c_~var_1_15~0)) (.cse2 ((_ sign_extend 16) c_~var_1_22~0)) (.cse0 ((_ sign_extend 16) c_~var_1_10~0)) (.cse4 ((_ zero_extend 24) c_~var_1_7~0))) (and (= ((_ extract 15 0) (bvadd (bvneg (bvadd (_ bv2 32) .cse0)) ((_ sign_extend 16) c_~var_1_9~0))) c_~var_1_8~0) (= c_~var_1_27~0 .cse1) (= (_ bv0 8) c_~var_1_18~0) (not (= ((_ sign_extend 24) c_~var_1_12~0) .cse2)) (not (bvuge .cse1 (bvudiv c_~var_1_27~0 ((_ sign_extend 24) c_~var_1_19~0)))) (let ((.cse3 (fp.gt c_~var_1_25~0 c_~var_1_26~0))) (or (and (= (fp.add c_currentRoundingMode c_~var_1_24~0 c_~var_1_25~0) c_~var_1_23~0) .cse3) (and (not .cse3) (= (fp.add c_currentRoundingMode c_~var_1_24~0 c_~var_1_26~0) c_~var_1_23~0)))) (bvsle .cse4 (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 15 0) (bvadd (bvneg (bvadd ((_ sign_extend 24) c_~var_1_16~0) .cse1)) .cse2 (bvneg .cse0)))) (bvsge .cse4 (_ bv1 32)) (fp.gt ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_23~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_23~0))))) is different from false [2024-11-28 05:33:15,225 WARN L286 SmtUtils]: Spent 5.21s 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-28 05:33:23,149 WARN L286 SmtUtils]: Spent 7.92s 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-28 05:33:34,308 WARN L286 SmtUtils]: Spent 7.34s 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-28 05:33:39,797 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:33:59,296 WARN L286 SmtUtils]: Spent 5.85s 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-28 05:34:05,822 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:34:10,947 WARN L286 SmtUtils]: Spent 5.13s 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-28 05:34:18,249 WARN L286 SmtUtils]: Spent 7.30s 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-28 05:34:24,523 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:36:07,325 WARN L286 SmtUtils]: Spent 1.16m on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:36:14,393 WARN L286 SmtUtils]: Spent 7.05s 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-28 05:36:31,432 WARN L286 SmtUtils]: Spent 7.60s 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-28 05:36:38,509 WARN L286 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:36:45,659 WARN L286 SmtUtils]: Spent 7.15s 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-28 05:36:52,055 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:36:59,635 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:37:06,651 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:37:23,026 WARN L286 SmtUtils]: Spent 5.92s 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-28 05:37:29,308 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:37:36,492 WARN L286 SmtUtils]: Spent 7.18s 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-28 05:37:43,438 WARN L286 SmtUtils]: Spent 6.95s 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-28 05:37:50,536 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:39:41,839 WARN L286 SmtUtils]: Spent 1.29m on a formula simplification that was a NOOP. DAG size: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)