./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya --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 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:27:53,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:27:53,553 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:27:53,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:27:53,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:27:53,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:27:53,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:27:53,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:27:53,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:27:53,582 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:27:53,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:27:53,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:27:53,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:27:53,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:27:53,585 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:27:53,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:27:53,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:27:53,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:27:53,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:27:53,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:27:53,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:27:53,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:27:53,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:27:53,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:27:53,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:27:53,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:27:53,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:27:53,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:27:53,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:27:53,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:27:53,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:27:53,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:27:53,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:27:53,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:27:53,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:27:53,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:27:53,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:27:53,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:27:53,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:27:53,595 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:27:53,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:27:53,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:27:53,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e [2023-11-29 03:27:53,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:27:53,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:27:53,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:27:53,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:27:53,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:27:53,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2023-11-29 03:27:56,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:27:56,815 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:27:56,816 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2023-11-29 03:27:56,825 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/c158fa847/36ad990675994db69e8766dd7e7f5bd7/FLAG60fb64671 [2023-11-29 03:27:56,842 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/c158fa847/36ad990675994db69e8766dd7e7f5bd7 [2023-11-29 03:27:56,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:27:56,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:27:56,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:27:56,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:27:56,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:27:56,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:27:56" (1/1) ... [2023-11-29 03:27:56,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233f4a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:56, skipping insertion in model container [2023-11-29 03:27:56,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:27:56" (1/1) ... [2023-11-29 03:27:56,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:27:57,046 WARN L240 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2023-11-29 03:27:57,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:27:57,106 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:27:57,119 WARN L240 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2023-11-29 03:27:57,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:27:57,162 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:27:57,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57 WrapperNode [2023-11-29 03:27:57,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:27:57,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:27:57,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:27:57,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:27:57,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,213 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2023-11-29 03:27:57,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:27:57,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:27:57,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:27:57,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:27:57,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,245 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]. [2023-11-29 03:27:57,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:27:57,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:27:57,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:27:57,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:27:57,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (1/1) ... [2023-11-29 03:27:57,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:27:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:27:57,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:27:57,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:27:57,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:27:57,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:27:57,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:27:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:27:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:27:57,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:27:57,435 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:27:57,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:27:57,725 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:27:57,767 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:27:57,767 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:27:57,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:27:57 BoogieIcfgContainer [2023-11-29 03:27:57,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:27:57,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:27:57,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:27:57,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:27:57,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:27:56" (1/3) ... [2023-11-29 03:27:57,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71222028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:27:57, skipping insertion in model container [2023-11-29 03:27:57,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:27:57" (2/3) ... [2023-11-29 03:27:57,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71222028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:27:57, skipping insertion in model container [2023-11-29 03:27:57,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:27:57" (3/3) ... [2023-11-29 03:27:57,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-75.i [2023-11-29 03:27:57,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:27:57,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:27:57,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:27:57,869 INFO L357 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, mHoare=true, 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;@360e94b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:27:57,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:27:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:27:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:27:57,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:27:57,891 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:27:57,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:27:57,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:27:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1654497880, now seen corresponding path program 1 times [2023-11-29 03:27:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:27:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844303262] [2023-11-29 03:27:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:27:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:27:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:27:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:27:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:27:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:27:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:27:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:27:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:27:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:27:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:27:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:27:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:27:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:27:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:27:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:27:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 03:27:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:27:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:27:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:27:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 03:27:58,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:27:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844303262] [2023-11-29 03:27:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844303262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:27:58,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:27:58,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:27:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805186276] [2023-11-29 03:27:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:27:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:27:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:27:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:27:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:27:58,280 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 03:27:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:27:58,319 INFO L93 Difference]: Finished difference Result 137 states and 239 transitions. [2023-11-29 03:27:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:27:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2023-11-29 03:27:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:27:58,330 INFO L225 Difference]: With dead ends: 137 [2023-11-29 03:27:58,330 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 03:27:58,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:27:58,338 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:27:58,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:27:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 03:27:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 03:27:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:27:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-11-29 03:27:58,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 124 [2023-11-29 03:27:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:27:58,387 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-11-29 03:27:58,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 03:27:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-11-29 03:27:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:27:58,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:27:58,394 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:27:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:27:58,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:27:58,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:27:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash -954669875, now seen corresponding path program 1 times [2023-11-29 03:27:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:27:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468576529] [2023-11-29 03:27:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:27:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:27:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:27:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:27:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:27:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:27:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:27:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:27:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:27:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:27:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:27:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:27:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:27:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:27:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:27:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:27:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 03:27:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:27:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:27:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:27:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 03:27:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:27:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468576529] [2023-11-29 03:27:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468576529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:27:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:27:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:27:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695253875] [2023-11-29 03:27:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:27:58,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:27:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:27:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:27:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:27:58,878 INFO L87 Difference]: Start difference. First operand 68 states and 105 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 03:27:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:27:59,015 INFO L93 Difference]: Finished difference Result 140 states and 218 transitions. [2023-11-29 03:27:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:27:59,016 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2023-11-29 03:27:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:27:59,019 INFO L225 Difference]: With dead ends: 140 [2023-11-29 03:27:59,020 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 03:27:59,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:27:59,022 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:27:59,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 170 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:27:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 03:27:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-11-29 03:27:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:27:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2023-11-29 03:27:59,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 125 [2023-11-29 03:27:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:27:59,039 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2023-11-29 03:27:59,039 INFO L496 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 03:27:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2023-11-29 03:27:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 03:27:59,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:27:59,042 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:27:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:27:59,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:27:59,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:27:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -959420450, now seen corresponding path program 1 times [2023-11-29 03:27:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:27:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137908902] [2023-11-29 03:27:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:27:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:27:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:27:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:27:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:27:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:27:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:27:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:27:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:27:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:27:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:27:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:27:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:27:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:27:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:27:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:27:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 03:27:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:27:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:27:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:27:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-29 03:27:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:27:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137908902] [2023-11-29 03:27:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137908902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:27:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888049655] [2023-11-29 03:27:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:59,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:27:59,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:27:59,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:27:59,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:27:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:59,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:27:59,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 243 proven. 33 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-11-29 03:28:00,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-29 03:28:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888049655] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:28:00,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:28:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 03:28:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589999861] [2023-11-29 03:28:00,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:28:00,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:28:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:28:00,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:28:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:28:00,337 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-29 03:28:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:01,279 INFO L93 Difference]: Finished difference Result 189 states and 281 transitions. [2023-11-29 03:28:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:28:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 126 [2023-11-29 03:28:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:01,283 INFO L225 Difference]: With dead ends: 189 [2023-11-29 03:28:01,283 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 03:28:01,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:28:01,285 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 203 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:01,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 338 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:28:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 03:28:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 72. [2023-11-29 03:28:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:28:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2023-11-29 03:28:01,307 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 126 [2023-11-29 03:28:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:01,308 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2023-11-29 03:28:01,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-29 03:28:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2023-11-29 03:28:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-29 03:28:01,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:01,311 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:01,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:28:01,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:28:01,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1553524692, now seen corresponding path program 1 times [2023-11-29 03:28:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:28:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344975280] [2023-11-29 03:28:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:28:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:28:01,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:28:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:28:01,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:28:01,676 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:28:01,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:28:01,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:28:01,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 03:28:01,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:28:01,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:28:01,751 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:28:01,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:28:01,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:28:01,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:28:01,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-29 03:28:01,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:28:01,754 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short23 could not be translated [2023-11-29 03:28:01,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:28:01 BoogieIcfgContainer [2023-11-29 03:28:01,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:28:01,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:28:01,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:28:01,773 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:28:01,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:27:57" (3/4) ... [2023-11-29 03:28:01,775 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:28:01,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:28:01,777 INFO L158 Benchmark]: Toolchain (without parser) took 4930.79ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 137.2MB in the beginning and 124.6MB in the end (delta: 12.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,778 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:28:01,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.93ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 123.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,779 INFO L158 Benchmark]: Boogie Preprocessor took 51.08ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 118.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,779 INFO L158 Benchmark]: RCFGBuilder took 502.10ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 96.7MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,780 INFO L158 Benchmark]: TraceAbstraction took 4001.20ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 96.1MB in the beginning and 125.7MB in the end (delta: -29.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,780 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 207.6MB. Free memory was 125.7MB in the beginning and 124.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:28:01,782 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.93ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 123.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.08ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 118.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 502.10ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 96.7MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4001.20ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 96.1MB in the beginning and 125.7MB in the end (delta: -29.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 207.6MB. Free memory was 125.7MB in the beginning and 124.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short23 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 122, overapproximation of bitwiseOr at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryArithmeticFLOAToperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] double last_1_var_1_22 = 200.8; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_22 = var_1_22 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L85] var_1_4 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L86] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L87] var_1_5 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L88] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L89] var_1_6 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L90] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L92] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L103] var_1_17 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L105] var_1_18 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L106] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L107] var_1_19 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L109] var_1_20 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L111] var_1_23 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L112] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L113] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L113] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=8, var_1_25=2, var_1_7=1] [L114] var_1_24 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_25=2, var_1_7=1] [L115] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_25=2, var_1_7=1] [L116] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=2, var_1_7=1] [L116] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=2, var_1_7=1] [L130] RET updateVariables() [L131] CALL step() [L46] COND TRUE ! (var_1_4 < 16.8f) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=2, var_1_6=1000000000006, var_1_7=1] [L49] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L50] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L51] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L59] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L62] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L63] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L68] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L75] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L77] COND TRUE (-1 <= var_1_25) || var_1_7 [L78] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L80] COND FALSE !((- (var_1_17 + var_1_1)) >= var_1_16) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L122-L123] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=65535, var_1_24=1, var_1_25=65535, var_1_6=1000000000006, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 289 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 49 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 SizeOfPredicates, 7 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3369/3420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:28:01,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya --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 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:28:03,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:28:03,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:28:03,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:28:03,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:28:03,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:28:03,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:28:03,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:28:03,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:28:03,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:28:03,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:28:03,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:28:03,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:28:03,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:28:03,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:28:03,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:28:03,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:28:03,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:28:03,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:28:03,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:28:03,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:28:03,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:28:03,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:28:03,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:28:03,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:28:03,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:28:03,872 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:28:03,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:28:03,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:28:03,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:28:03,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:28:03,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:28:03,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:28:03,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:28:03,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:28:03,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:28:03,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:28:03,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:28:03,876 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:28:03,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:28:03,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:28:03,876 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:28:03,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:28:03,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:28:03,877 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:28:03,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e [2023-11-29 03:28:04,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:28:04,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:28:04,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:28:04,189 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:28:04,189 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:28:04,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2023-11-29 03:28:07,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:28:07,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:28:07,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2023-11-29 03:28:07,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/1be03d7e7/0e0663aeff8e4b9aba91444e2d9c5c1c/FLAG3a69a1751 [2023-11-29 03:28:07,235 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/data/1be03d7e7/0e0663aeff8e4b9aba91444e2d9c5c1c [2023-11-29 03:28:07,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:28:07,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:28:07,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:07,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:28:07,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:28:07,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcdeddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07, skipping insertion in model container [2023-11-29 03:28:07,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:28:07,450 WARN L240 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2023-11-29 03:28:07,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:07,520 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:28:07,534 WARN L240 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_c6e3fa16-bfca-4b0a-a548-6995dac15530/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2023-11-29 03:28:07,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:07,585 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:28:07,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07 WrapperNode [2023-11-29 03:28:07,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:07,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:28:07,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:28:07,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:28:07,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,640 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2023-11-29 03:28:07,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:28:07,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:28:07,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:28:07,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:28:07,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,674 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]. [2023-11-29 03:28:07,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:28:07,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:28:07,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:28:07,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:28:07,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (1/1) ... [2023-11-29 03:28:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:28:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:28:07,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:28:07,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:28:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:28:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:28:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:28:07,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:28:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:28:07,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:28:07,847 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:28:07,850 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:28:29,851 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:28:29,904 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:28:29,905 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:28:29,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:28:29 BoogieIcfgContainer [2023-11-29 03:28:29,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:28:29,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:28:29,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:28:29,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:28:29,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:28:07" (1/3) ... [2023-11-29 03:28:29,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb915ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:28:29, skipping insertion in model container [2023-11-29 03:28:29,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:07" (2/3) ... [2023-11-29 03:28:29,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb915ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:28:29, skipping insertion in model container [2023-11-29 03:28:29,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:28:29" (3/3) ... [2023-11-29 03:28:29,914 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-75.i [2023-11-29 03:28:29,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:28:29,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:28:29,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:28:29,981 INFO L357 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, mHoare=true, 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;@3503316a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:28:29,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:28:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:28:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 03:28:30,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:30,000 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:30,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:28:30,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1839891907, now seen corresponding path program 1 times [2023-11-29 03:28:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:30,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612711977] [2023-11-29 03:28:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:30,019 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 [2023-11-29 03:28:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:30,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:28:30,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:28:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:30,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:28:30,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 03:28:30,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:30,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612711977] [2023-11-29 03:28:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612711977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:30,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045968107] [2023-11-29 03:28:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:30,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:28:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:28:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:28:30,802 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 03:28:35,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:28:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:35,280 INFO L93 Difference]: Finished difference Result 107 states and 187 transitions. [2023-11-29 03:28:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:28:35,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 03:28:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:35,402 INFO L225 Difference]: With dead ends: 107 [2023-11-29 03:28:35,402 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 03:28:35,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:28:35,408 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 03:28:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 03:28:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 03:28:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 03:28:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-11-29 03:28:35,448 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 120 [2023-11-29 03:28:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:35,450 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-11-29 03:28:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 03:28:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2023-11-29 03:28:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:28:35,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:35,453 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:35,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:28:35,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:28:35,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1673799123, now seen corresponding path program 1 times [2023-11-29 03:28:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237023865] [2023-11-29 03:28:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:35,656 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 [2023-11-29 03:28:35,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:35,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:28:35,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e3fa16-bfca-4b0a-a548-6995dac15530/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:28:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:36,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 03:28:36,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:48,370 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:28:56,541 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:04,633 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:12,833 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:21,003 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:29,183 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:37,347 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:45,522 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:29:57,166 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:09,443 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:17,628 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:25,804 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:33,995 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:38,051 WARN L854 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from false [2023-11-29 03:30:42,097 WARN L876 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from true [2023-11-29 03:30:50,581 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:30:58,951 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:07,254 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:15,675 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:23,968 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:32,358 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:40,744 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:49,128 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:31:57,518 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:05,863 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:14,267 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:22,648 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:31,064 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:39,484 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:47,844 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:32:56,271 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:04,703 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:08,794 WARN L854 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from false [2023-11-29 03:33:12,906 WARN L876 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from true [2023-11-29 03:33:21,374 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:29,838 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:38,264 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:46,707 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:33:55,013 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:03,425 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:11,884 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:20,416 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:29,041 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:37,507 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:45,966 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:34:54,507 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:02,915 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:11,310 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:19,722 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:28,185 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:36,657 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:45,229 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:35:49,335 WARN L854 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from false [2023-11-29 03:35:53,452 WARN L876 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from true [2023-11-29 03:36:01,992 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:10,534 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:19,152 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:27,564 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:36,040 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:44,516 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:36:53,017 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:01,668 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:10,219 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:18,847 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:27,444 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:36,058 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:44,565 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:37:53,106 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:01,654 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:10,240 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:18,928 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:27,500 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:36,091 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:44,812 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:38:48,934 WARN L854 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (fp.geq (fp.neg (fp.add c_currentRoundingMode c_~var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_1~0))) c_~var_1_16~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_21~0 (_ bv50 8)) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from false [2023-11-29 03:38:53,064 WARN L876 $PredicateComparison]: unable to prove that (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (fp.geq (fp.neg (fp.add c_currentRoundingMode c_~var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_1~0))) c_~var_1_16~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (= c_~var_1_21~0 (_ bv50 8)) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) is different from true