./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_alt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:27:40,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:27:40,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:27:40,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:27:40,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:27:40,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:27:40,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:27:40,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:27:40,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:27:40,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:27:40,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:27:40,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:27:40,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:27:40,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:27:40,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:27:40,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:27:40,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:27:40,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:27:40,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:27:40,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:27:40,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:27:40,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:27:40,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:27:40,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:40,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:27:40,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:40,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:27:40,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2024-11-27 23:27:40,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:27:40,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:27:40,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:27:40,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:27:40,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:27:40,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2_alt.c [2024-11-27 23:27:44,139 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/f1493e246/c6c39d830ea44f2abbd6e8959fe4cb7c/FLAG33b1e833c [2024-11-27 23:27:44,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:27:44,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-11-27 23:27:44,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/f1493e246/c6c39d830ea44f2abbd6e8959fe4cb7c/FLAG33b1e833c [2024-11-27 23:27:44,448 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/f1493e246/c6c39d830ea44f2abbd6e8959fe4cb7c [2024-11-27 23:27:44,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:27:44,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:27:44,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:27:44,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:27:44,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:27:44,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca4064a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44, skipping insertion in model container [2024-11-27 23:27:44,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:27:44,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2024-11-27 23:27:44,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:27:44,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:27:44,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2024-11-27 23:27:44,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:27:44,810 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:27:44,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44 WrapperNode [2024-11-27 23:27:44,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:27:44,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:27:44,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:27:44,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:27:44,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,863 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2024-11-27 23:27:44,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:27:44,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:27:44,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:27:44,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:27:44,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,902 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2024-11-27 23:27:44,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:27:44,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:27:44,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:27:44,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:27:44,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (1/1) ... [2024-11-27 23:27:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:44,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:27:44,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:27:45,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:27:45,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:27:45,027 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-11-27 23:27:45,027 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-11-27 23:27:45,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:27:45,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:27:45,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-27 23:27:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:27:45,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:27:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-27 23:27:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-27 23:27:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-27 23:27:45,172 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:27:45,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:27:45,359 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-27 23:27:45,360 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:27:45,369 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:27:45,370 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:27:45,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:27:45 BoogieIcfgContainer [2024-11-27 23:27:45,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:27:45,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:27:45,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:27:45,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:27:45,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:27:44" (1/3) ... [2024-11-27 23:27:45,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adeb6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:27:45, skipping insertion in model container [2024-11-27 23:27:45,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:44" (2/3) ... [2024-11-27 23:27:45,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adeb6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:27:45, skipping insertion in model container [2024-11-27 23:27:45,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:27:45" (3/3) ... [2024-11-27 23:27:45,382 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2024-11-27 23:27:45,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:27:45,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_alt.c that has 2 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 23:27:45,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:27:45,506 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19947ab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:27:45,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:27:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 23:27:45,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:27:45,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:27:45,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:27:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:27:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1023998607, now seen corresponding path program 1 times [2024-11-27 23:27:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:27:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112849372] [2024-11-27 23:27:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:27:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:27:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 23:27:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:27:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112849372] [2024-11-27 23:27:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112849372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:27:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400587520] [2024-11-27 23:27:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:45,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:27:45,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:27:45,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:27:45,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:27:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:27:45,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:27:45,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:27:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:27:45,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:27:45,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400587520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:27:45,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:27:45,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 23:27:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755577185] [2024-11-27 23:27:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:27:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:27:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:27:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:27:45,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:27:45,927 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:27:45,944 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-11-27 23:27:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:27:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-27 23:27:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:27:45,954 INFO L225 Difference]: With dead ends: 37 [2024-11-27 23:27:45,954 INFO L226 Difference]: Without dead ends: 18 [2024-11-27 23:27:45,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:27:45,962 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:27:45,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:27:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-27 23:27:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-27 23:27:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-27 23:27:46,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 19 [2024-11-27 23:27:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:27:46,014 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-27 23:27:46,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-27 23:27:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 23:27:46,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:27:46,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:27:46,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:27:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 23:27:46,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:27:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:27:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1181758385, now seen corresponding path program 1 times [2024-11-27 23:27:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:27:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612545173] [2024-11-27 23:27:46,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:27:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:27:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:27:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:27:46,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612545173] [2024-11-27 23:27:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612545173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:27:46,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:27:46,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:27:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516132223] [2024-11-27 23:27:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:27:46,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:27:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:27:46,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:27:46,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:27:46,371 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:27:46,395 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-27 23:27:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:27:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-27 23:27:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:27:46,397 INFO L225 Difference]: With dead ends: 42 [2024-11-27 23:27:46,397 INFO L226 Difference]: Without dead ends: 28 [2024-11-27 23:27:46,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:27:46,399 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:27:46,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:27:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-27 23:27:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-27 23:27:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:27:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-27 23:27:46,408 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2024-11-27 23:27:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:27:46,408 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-27 23:27:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-27 23:27:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 23:27:46,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:27:46,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:27:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:27:46,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:27:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:27:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash -627706639, now seen corresponding path program 1 times [2024-11-27 23:27:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:27:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292181790] [2024-11-27 23:27:46,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:27:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:27:46,498 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:27:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:27:46,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:27:46,561 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:27:46,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:27:46,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:27:46,569 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-27 23:27:46,630 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:27:46,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:27:46 BoogieIcfgContainer [2024-11-27 23:27:46,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:27:46,639 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:27:46,639 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:27:46,639 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:27:46,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:27:45" (3/4) ... [2024-11-27 23:27:46,644 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 23:27:46,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:27:46,646 INFO L158 Benchmark]: Toolchain (without parser) took 2192.55ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 80.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-27 23:27:46,646 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:27:46,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.74ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:27:46,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.34ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:27:46,650 INFO L158 Benchmark]: Boogie Preprocessor took 76.23ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:27:46,652 INFO L158 Benchmark]: RCFGBuilder took 429.37ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:27:46,652 INFO L158 Benchmark]: TraceAbstraction took 1264.93ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 81.0MB in the end (delta: -14.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:27:46,652 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 80.4MB in the end (delta: 598.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:27:46,655 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.26ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.74ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.34ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.23ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 429.37ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1264.93ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 81.0MB in the end (delta: -14.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 80.4MB in the end (delta: 598.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: 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 26, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float P, X; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L52] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0, \result=57] [L52] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L52] X = RANDOM_INPUT() [L53] INIT = TRUE VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=57] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=57] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=57] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=57, \result=56] [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=57] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND TRUE \read(INIT) [L34] S[0] = X [L35] P = X [L36] E[0] = X VAL [E={4:0}, INIT=1, P=56, S={5:0}, X=56] [L46] EXPR E[0] [L46] E[1] = E[0] [L46] E[0] = X [L47] EXPR S[0] [L47] S[1] = S[0] [L47] S[0] = P VAL [E={4:0}, INIT=1, P=56, S={5:0}, X=56] [L56] RET filter2 () [L57] INIT = FALSE VAL [E={4:0}, INIT=0, P=56, S={5:0}, X=56] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=56, S={5:0}, X=56] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=56, S={5:0}, X=56] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=0, P=56, S={5:0}, X=56, \result=55] [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=56, S={5:0}, X=56] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND FALSE !(\read(INIT)) [L39] EXPR E[0] [L40] EXPR E[1] [L41] EXPR S[0] [L42] EXPR S[1] [L38-L42] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L43] CALL __VERIFIER_assert(P >= -15.f && P <= 15.f) [L14] COND TRUE !(cond) VAL [E={4:0}, INIT=0, S={5:0}, X=55] [L14] reach_error() VAL [E={4:0}, INIT=0, S={5:0}, X=55] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 43 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 60 SizeOfPredicates, 0 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 23:27:46,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:27:49,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:27:49,737 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 23:27:49,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:27:49,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:27:49,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:27:49,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:27:49,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:27:49,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:27:49,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:27:49,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:27:49,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:27:49,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:27:49,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:27:49,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:27:49,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:27:49,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:27:49,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:27:49,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:49,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:27:49,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:49,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:27:49,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:27:49,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:27:49,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:27:49,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2024-11-27 23:27:50,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:27:50,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:27:50,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:27:50,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:27:50,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:27:50,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2_alt.c [2024-11-27 23:27:53,417 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/38cfd38d7/26fb0d3d56db4a2ea8a06924853e407a/FLAGba634d422 [2024-11-27 23:27:53,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:27:53,759 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-11-27 23:27:53,804 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/38cfd38d7/26fb0d3d56db4a2ea8a06924853e407a/FLAGba634d422 [2024-11-27 23:27:53,854 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/data/38cfd38d7/26fb0d3d56db4a2ea8a06924853e407a [2024-11-27 23:27:53,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:27:53,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:27:53,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:27:53,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:27:53,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:27:53,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:27:53" (1/1) ... [2024-11-27 23:27:53,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fab5509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:53, skipping insertion in model container [2024-11-27 23:27:53,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:27:53" (1/1) ... [2024-11-27 23:27:53,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:27:54,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2024-11-27 23:27:54,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:27:54,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:27:54,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2024-11-27 23:27:54,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:27:54,244 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:27:54,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54 WrapperNode [2024-11-27 23:27:54,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:27:54,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:27:54,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:27:54,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:27:54,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,306 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-11-27 23:27:54,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:27:54,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:27:54,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:27:54,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:27:54,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,341 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2024-11-27 23:27:54,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:27:54,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:27:54,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:27:54,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:27:54,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (1/1) ... [2024-11-27 23:27:54,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:27:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:27:54,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:27:54,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:27:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:27:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-11-27 23:27:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-11-27 23:27:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-27 23:27:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:27:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-27 23:27:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-27 23:27:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-27 23:27:54,548 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:27:54,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:27:58,820 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-27 23:27:58,820 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:27:58,841 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:27:58,841 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:27:58,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:27:58 BoogieIcfgContainer [2024-11-27 23:27:58,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:27:58,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:27:58,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:27:58,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:27:58,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:27:53" (1/3) ... [2024-11-27 23:27:58,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7ff74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:27:58, skipping insertion in model container [2024-11-27 23:27:58,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:27:54" (2/3) ... [2024-11-27 23:27:58,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7ff74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:27:58, skipping insertion in model container [2024-11-27 23:27:58,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:27:58" (3/3) ... [2024-11-27 23:27:58,856 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2024-11-27 23:27:58,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:27:58,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_alt.c that has 2 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 23:27:58,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:27:58,948 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63a08f69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:27:58,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:27:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 23:27:58,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:27:58,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:27:58,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:27:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:27:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1023998607, now seen corresponding path program 1 times [2024-11-27 23:27:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:27:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089454803] [2024-11-27 23:27:58,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:27:58,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:27:58,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:27:58,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-27 23:27:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:27:59,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:27:59,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:27:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:27:59,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:27:59,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:27:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089454803] [2024-11-27 23:27:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089454803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:27:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:27:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:27:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927052351] [2024-11-27 23:27:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:27:59,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:27:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:27:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:27:59,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:27:59,492 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:27:59,512 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-11-27 23:27:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:27:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-27 23:27:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:27:59,524 INFO L225 Difference]: With dead ends: 37 [2024-11-27 23:27:59,524 INFO L226 Difference]: Without dead ends: 18 [2024-11-27 23:27:59,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:27:59,535 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:27:59,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:27:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-27 23:27:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-27 23:27:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-27 23:27:59,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 19 [2024-11-27 23:27:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:27:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-27 23:27:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:27:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-27 23:27:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 23:27:59,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:27:59,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:27:59,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-27 23:27:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:27:59,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:27:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:27:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1181758385, now seen corresponding path program 1 times [2024-11-27 23:27:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:27:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868800014] [2024-11-27 23:27:59,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:27:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:27:59,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:27:59,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:27:59,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-27 23:28:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:00,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 23:28:00,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:00,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:00,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:28:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868800014] [2024-11-27 23:28:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868800014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:00,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:28:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645810081] [2024-11-27 23:28:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:28:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:00,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:00,512 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:04,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:28:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:04,737 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-27 23:28:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-27 23:28:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:04,776 INFO L225 Difference]: With dead ends: 42 [2024-11-27 23:28:04,776 INFO L226 Difference]: Without dead ends: 28 [2024-11-27 23:28:04,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:04,777 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-27 23:28:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-27 23:28:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-27 23:28:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:28:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-27 23:28:04,787 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2024-11-27 23:28:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:04,787 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-27 23:28:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-27 23:28:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 23:28:04,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:04,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:04,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-27 23:28:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:28:04,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -627706639, now seen corresponding path program 1 times [2024-11-27 23:28:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:28:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531381482] [2024-11-27 23:28:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:28:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:28:04,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:28:04,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-27 23:28:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:09,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-27 23:28:09,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:10,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:28:10,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:28:11,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 138 [2024-11-27 23:28:11,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 49 [2024-11-27 23:28:14,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:28:14,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 579 treesize of output 429 [2024-11-27 23:28:15,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:28:15,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 309 [2024-11-27 23:28:23,232 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:31,298 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:39,414 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:47,477 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:55,640 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:03,752 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:11,915 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:20,056 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:28,166 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:36,289 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:44,437 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:52,494 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:00,590 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:08,672 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:16,825 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:24,929 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:33,077 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:41,202 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:49,323 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:57,431 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:05,566 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:13,687 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:21,798 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:29,903 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:38,015 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:46,069 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:54,160 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:02,306 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:10,453 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:18,586 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:26,715 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:34,823 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:42,926 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:51,093 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:59,154 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:07,262 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:15,373 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:23,489 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:31,596 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:39,753 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:47,895 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:56,026 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:04,143 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:12,260 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:20,354 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:28,474 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:36,659 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:44,772 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:34:52,895 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:01,106 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:09,168 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:17,314 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:25,463 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:33,584 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:41,727 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:49,858 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:35:57,972 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:06,077 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:14,196 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:22,307 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:30,414 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:38,524 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:50,720 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:36:58,841 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:06,983 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:15,130 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:23,305 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:31,444 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:39,582 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:47,697 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:37:55,810 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:03,929 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:12,040 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:28,364 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:36,434 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:44,554 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:56,783 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:04,943 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:13,060 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:17,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 15.0))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse14 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse3 (fp.neg .cse8)) (.cse4 (fp.neg .cse1))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (~X~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse7 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse6 .cse12)) (fp.mul roundNearestTiesToEven .cse10 .cse13)) (fp.mul roundNearestTiesToEven .cse9 .cse14)) (fp.mul roundNearestTiesToEven .cse7 .cse15))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.leq .cse0 .cse1) (fp.leq ~X~0 .cse1) (fp.geq .cse2 .cse3) (fp.geq .cse0 .cse4) (= .cse0 .cse5) (= .cse0 .cse6) (= .cse0 .cse7) (fp.geq ~X~0 .cse4) (fp.leq .cse2 .cse8) (= .cse0 .cse9) (= .cse10 .cse5))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse21 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse16 .cse1) (fp.geq .cse16 .cse4) (= .cse16 .cse17) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse20 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse16 .cse18) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse16 .cse19) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse20 .cse12)) (fp.mul roundNearestTiesToEven .cse21 .cse13)) (fp.mul roundNearestTiesToEven .cse19 .cse14)) (fp.mul roundNearestTiesToEven .cse18 .cse15)) .cse8)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse4))))))))) (= .cse16 .cse20))))))) (= .cse21 .cse17)))) (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse26 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse23 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse22 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse22 .cse1) (fp.geq .cse22 .cse4) (= .cse22 .cse23) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse24 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse22 .cse24) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse27 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse25 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse22 .cse25) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse24 .cse12)) (fp.mul roundNearestTiesToEven .cse26 .cse13)) (fp.mul roundNearestTiesToEven .cse25 .cse14)) (fp.mul roundNearestTiesToEven .cse27 .cse15)) .cse3)) (fp.geq ~X~0 .cse4)))))) (= .cse22 .cse27)))))))))) (= .cse26 .cse23))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2024-11-27 23:39:29,446 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:37,620 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:45,778 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:39:58,061 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:40:06,125 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:40:14,242 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:40:18,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg .cse1))) (or (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (= .cse0 .cse3) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 .cse4) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse5) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 ~X~0) (fp.mul roundNearestTiesToEven .cse7 .cse8)) (fp.mul roundNearestTiesToEven .cse9 .cse10)) (fp.mul roundNearestTiesToEven .cse5 .cse11)) (fp.mul roundNearestTiesToEven .cse4 .cse12)) .cse13)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse2))))))))) (= .cse0 .cse7))))))) (= .cse9 .cse3)))) (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse15 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse14 .cse1) (fp.geq .cse14 .cse2) (= .cse14 .cse15) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse14 .cse16) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse14 .cse17) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 ~X~0) (fp.mul roundNearestTiesToEven .cse16 .cse8)) (fp.mul roundNearestTiesToEven .cse18 .cse10)) (fp.mul roundNearestTiesToEven .cse17 .cse11)) (fp.mul roundNearestTiesToEven .cse19 .cse12)) (fp.neg .cse13))) (fp.geq ~X~0 .cse2)))))) (= .cse14 .cse19)))))))))) (= .cse18 .cse15))))))) is different from false [2024-11-27 23:40:22,363 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg .cse1))) (or (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (= .cse0 .cse3) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 .cse4) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse5) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 ~X~0) (fp.mul roundNearestTiesToEven .cse7 .cse8)) (fp.mul roundNearestTiesToEven .cse9 .cse10)) (fp.mul roundNearestTiesToEven .cse5 .cse11)) (fp.mul roundNearestTiesToEven .cse4 .cse12)) .cse13)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse2))))))))) (= .cse0 .cse7))))))) (= .cse9 .cse3)))) (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse15 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse14 .cse1) (fp.geq .cse14 .cse2) (= .cse14 .cse15) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse14 .cse16) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse14 .cse17) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 ~X~0) (fp.mul roundNearestTiesToEven .cse16 .cse8)) (fp.mul roundNearestTiesToEven .cse18 .cse10)) (fp.mul roundNearestTiesToEven .cse17 .cse11)) (fp.mul roundNearestTiesToEven .cse19 .cse12)) (fp.neg .cse13))) (fp.geq ~X~0 .cse2)))))) (= .cse14 .cse19)))))))))) (= .cse18 .cse15))))))) is different from true [2024-11-27 23:40:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:40:22,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:40:22,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:40:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531381482] [2024-11-27 23:40:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531381482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:40:22,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:40:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 23:40:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254361132] [2024-11-27 23:40:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:40:22,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 23:40:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:40:22,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 23:40:22,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=3, NotChecked=54, Total=272 [2024-11-27 23:40:22,367 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:40:29,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:34,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:38,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:42,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:46,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:50,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:54,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:40:58,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:02,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:06,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:10,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:14,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (let ((.cse8 (fp.neg .cse6))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse5 (select |c_#memory_int#1| |c_~#E~0.base|)) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (select |c_#memory_int#2| |c_~#S~0.base|))) (and (= .cse0 (let ((.cse1 (select .cse2 |c_~#S~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= .cse3 (let ((.cse4 (select .cse5 (bvadd |c_~#E~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (fp.leq .cse0 .cse6) (= .cse0 .cse3) (= .cse0 (let ((.cse7 (select .cse5 |c_~#E~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (fp.geq .cse0 .cse8) (= .cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_~#S~0.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 10.0)) (.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 15.0))) (let ((.cse21 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse24 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse25 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse13 (fp.neg .cse18)) (.cse14 (fp.neg .cse11))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (~X~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse20 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse16 .cse22)) (fp.mul roundNearestTiesToEven .cse20 .cse23)) (fp.mul roundNearestTiesToEven .cse19 .cse24)) (fp.mul roundNearestTiesToEven .cse17 .cse25))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse15 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.leq .cse10 .cse11) (fp.leq ~X~0 .cse11) (fp.geq .cse12 .cse13) (fp.geq .cse10 .cse14) (= .cse10 .cse15) (= .cse10 .cse16) (= .cse10 .cse17) (fp.geq ~X~0 .cse14) (fp.leq .cse12 .cse18) (= .cse10 .cse19) (= .cse20 .cse15))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse31 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse27 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse26 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse26 .cse11) (fp.geq .cse26 .cse14) (= .cse26 .cse27) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse30 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse28 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse26 .cse28) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse29 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse26 .cse29) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse30 .cse22)) (fp.mul roundNearestTiesToEven .cse31 .cse23)) (fp.mul roundNearestTiesToEven .cse29 .cse24)) (fp.mul roundNearestTiesToEven .cse28 .cse25)) .cse18)) (fp.leq ~X~0 .cse11) (fp.geq ~X~0 .cse14))))))))) (= .cse26 .cse30))))))) (= .cse31 .cse27)))) (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse36 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse33 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse32 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse32 .cse11) (fp.geq .cse32 .cse14) (= .cse32 .cse33) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse34 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse32 .cse34) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse37 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse35 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse32 .cse35) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse11) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse34 .cse22)) (fp.mul roundNearestTiesToEven .cse36 .cse23)) (fp.mul roundNearestTiesToEven .cse35 .cse24)) (fp.mul roundNearestTiesToEven .cse37 .cse25)) .cse13)) (fp.geq ~X~0 .cse14)))))) (= .cse32 .cse37)))))))))) (= .cse36 .cse33))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) (fp.geq c_~X~0 .cse8) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~X~0 .cse6)))) is different from false [2024-11-27 23:41:18,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:41:22,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:26,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:30,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:41:34,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:38,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:41:42,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:46,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:41:50,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:41:54,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:41:58,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:42:02,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:42:06,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:42:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:42:06,763 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-27 23:42:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:42:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-27 23:42:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:42:06,809 INFO L225 Difference]: With dead ends: 39 [2024-11-27 23:42:06,809 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 23:42:06,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=103, Invalid=285, Unknown=4, NotChecked=114, Total=506 [2024-11-27 23:42:06,811 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 98.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:42:06,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 24 Unknown, 88 Unchecked, 98.3s Time] [2024-11-27 23:42:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 23:42:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-27 23:42:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 23:42:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-27 23:42:06,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2024-11-27 23:42:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:42:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-27 23:42:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:42:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-27 23:42:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 23:42:06,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:42:06,822 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:42:06,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-27 23:42:07,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:42:07,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:42:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:42:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1786131318, now seen corresponding path program 1 times [2024-11-27 23:42:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:42:07,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691929788] [2024-11-27 23:42:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:42:07,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:42:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:42:07,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:42:07,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf26a1c-1e94-48c4-a921-6c447ea6073d/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process