./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2.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_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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_888b7902-4599-4672-8c06-62cb718344c8/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 e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:31:50,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:31:50,630 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:31:50,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:31:50,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:31:50,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:31:50,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:31:50,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:31:50,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:31:50,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:31:50,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:31:50,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:31:50,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:31:50,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:31:50,668 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:31:50,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:31:50,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:31:50,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:31:50,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:31:50,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:31:50,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:31:50,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:31:50,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:31:50,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:31:50,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:50,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:50,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:50,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:50,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:31:50,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:50,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:50,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:50,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:50,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:31:50,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:31:50,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:31:50,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:31:50,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:31:50,674 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_888b7902-4599-4672-8c06-62cb718344c8/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 -> e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 [2024-11-27 20:31:51,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:31:51,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:31:51,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:31:51,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:31:51,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:31:51,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2.c [2024-11-27 20:31:54,401 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/81ae109e5/cbe8d2f0b6e642d99d73d981e65270e6/FLAG3591ccf7c [2024-11-27 20:31:54,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:31:54,722 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c [2024-11-27 20:31:54,731 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/81ae109e5/cbe8d2f0b6e642d99d73d981e65270e6/FLAG3591ccf7c [2024-11-27 20:31:54,748 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/81ae109e5/cbe8d2f0b6e642d99d73d981e65270e6 [2024-11-27 20:31:54,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:31:54,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:31:54,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:54,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:31:54,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:31:54,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:54,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c696339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54, skipping insertion in model container [2024-11-27 20:31:54,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:54,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:31:54,968 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_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2024-11-27 20:31:54,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:55,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:31:55,024 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_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2024-11-27 20:31:55,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:55,059 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:31:55,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55 WrapperNode [2024-11-27 20:31:55,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:55,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:55,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:31:55,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:31:55,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,098 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-27 20:31:55,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:55,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:31:55,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:31:55,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:31:55,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:31:55,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:31:55,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:31:55,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:31:55,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:31:55,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (1/1) ... [2024-11-27 20:31:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:55,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:55,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:31:55,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:31:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:31:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:31:55,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:31:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:31:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:31:55,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:31:55,336 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:31:55,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:31:55,514 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-27 20:31:55,514 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:31:55,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:31:55,531 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:31:55,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:31:55 BoogieIcfgContainer [2024-11-27 20:31:55,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:31:55,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:31:55,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:31:55,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:31:55,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:31:54" (1/3) ... [2024-11-27 20:31:55,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af2056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:31:55, skipping insertion in model container [2024-11-27 20:31:55,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:55" (2/3) ... [2024-11-27 20:31:55,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af2056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:31:55, skipping insertion in model container [2024-11-27 20:31:55,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:31:55" (3/3) ... [2024-11-27 20:31:55,555 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2.c [2024-11-27 20:31:55,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:31:55,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:31:55,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:31:55,682 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;@64a8b85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:31:55,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:31:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:31:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:31:55,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:31:55,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:55,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:31:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1574874756, now seen corresponding path program 1 times [2024-11-27 20:31:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943387248] [2024-11-27 20:31:55,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:31:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943387248] [2024-11-27 20:31:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943387248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:31:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84959565] [2024-11-27 20:31:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:55,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:31:55,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:55,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:31:55,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:31:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:56,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:31:56,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:31:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:31:56,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:31:56,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84959565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:56,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:31:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 20:31:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576204030] [2024-11-27 20:31:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:31:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:31:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:31:56,078 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:31:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:31:56,104 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-11-27 20:31:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:31:56,108 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-27 20:31:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:31:56,115 INFO L225 Difference]: With dead ends: 39 [2024-11-27 20:31:56,116 INFO L226 Difference]: Without dead ends: 17 [2024-11-27 20:31:56,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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 20:31:56,126 INFO L435 NwaCegarLoop]: 23 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, 23 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 20:31:56,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:31:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-27 20:31:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-27 20:31:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:31:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-27 20:31:56,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-27 20:31:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:31:56,175 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-27 20:31:56,175 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:31:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-27 20:31:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:31:56,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:31:56,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:56,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:31:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:31:56,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:31:56,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 77289850, now seen corresponding path program 1 times [2024-11-27 20:31:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735170881] [2024-11-27 20:31:56,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:31:56,454 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:31:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:31:56,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:31:56,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:31:56,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:31:56,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:31:56,537 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-27 20:31:56,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:31:56,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:31:56 BoogieIcfgContainer [2024-11-27 20:31:56,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:31:56,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:31:56,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:31:56,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:31:56,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:31:55" (3/4) ... [2024-11-27 20:31:56,566 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:31:56,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:31:56,568 INFO L158 Benchmark]: Toolchain (without parser) took 1813.85ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 42.2MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-27 20:31:56,568 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:56,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.26ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 82.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:31:56,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.75ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:56,570 INFO L158 Benchmark]: Boogie Preprocessor took 56.29ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:56,570 INFO L158 Benchmark]: RCFGBuilder took 377.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 69.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:31:56,571 INFO L158 Benchmark]: TraceAbstraction took 1024.30ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 42.2MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:31:56,571 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 117.4MB. Free memory is still 42.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:56,573 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.41ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.26ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 82.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.75ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.29ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 69.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1024.30ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 42.2MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 117.4MB. Free memory is still 42.2MB. 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: 17]: 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 someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of to_real at line 30. Possible FailurePath: [L22] double E, E0, E1, S0, S1, S; [L23] int i; [L25] E = __VERIFIER_nondet_double() [L26] E0 = __VERIFIER_nondet_double() [L27] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1] [L27] RET assume_abort_if_not(E >= 0. && E <= 1.) [L28] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L30] S0 = 0 [L31] S = 0 [L33] i = 0 VAL [i=0] [L33] COND TRUE i <= 1000000 VAL [i=0] [L34] E1 = E0 [L35] E0 = E [L37] E = __VERIFIER_nondet_double() [L38] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E0=53, i=0] [L40] S1 = S0 [L41] S0 = S [L42] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L44] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 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 20:31:56,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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_888b7902-4599-4672-8c06-62cb718344c8/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 e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:31:59,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:31:59,971 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:31:59,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:31:59,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:32:00,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:32:00,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:32:00,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:32:00,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:32:00,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:32:00,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:32:00,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:32:00,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:32:00,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:32:00,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:32:00,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:32:00,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:32:00,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:32:00,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:32:00,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:32:00,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:32:00,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:32:00,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:32:00,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:32:00,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:32:00,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:32:00,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:32:00,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:32:00,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:32:00,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:32:00,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:32:00,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:32:00,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:32:00,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:32:00,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:32:00,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:32:00,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:32:00,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:32:00,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:32:00,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:32:00,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:32:00,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:32:00,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:32:00,051 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_888b7902-4599-4672-8c06-62cb718344c8/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 -> e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 [2024-11-27 20:32:00,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:32:00,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:32:00,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:32:00,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:32:00,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:32:00,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2.c [2024-11-27 20:32:03,708 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/23c6e55c6/9975a5deedf44a15a2f1489a92d0dd06/FLAG22b9df26b [2024-11-27 20:32:04,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:32:04,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c [2024-11-27 20:32:04,129 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/23c6e55c6/9975a5deedf44a15a2f1489a92d0dd06/FLAG22b9df26b [2024-11-27 20:32:04,165 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/data/23c6e55c6/9975a5deedf44a15a2f1489a92d0dd06 [2024-11-27 20:32:04,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:32:04,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:32:04,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:32:04,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:32:04,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:32:04,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c74ba09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04, skipping insertion in model container [2024-11-27 20:32:04,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:32:04,429 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_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2024-11-27 20:32:04,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:32:04,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:32:04,486 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_888b7902-4599-4672-8c06-62cb718344c8/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2024-11-27 20:32:04,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:32:04,520 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:32:04,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04 WrapperNode [2024-11-27 20:32:04,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:32:04,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:32:04,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:32:04,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:32:04,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,573 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2024-11-27 20:32:04,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:32:04,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:32:04,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:32:04,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:32:04,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:32:04,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:32:04,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:32:04,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:32:04,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:32:04,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (1/1) ... [2024-11-27 20:32:04,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:32:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:32:04,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:32:04,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:32:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:32:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:32:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:32:04,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:32:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:32:04,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:32:04,851 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:32:04,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:32:09,269 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-27 20:32:09,269 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:32:09,287 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:32:09,287 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:32:09,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:32:09 BoogieIcfgContainer [2024-11-27 20:32:09,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:32:09,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:32:09,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:32:09,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:32:09,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:32:04" (1/3) ... [2024-11-27 20:32:09,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dd274d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:32:09, skipping insertion in model container [2024-11-27 20:32:09,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:32:04" (2/3) ... [2024-11-27 20:32:09,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dd274d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:32:09, skipping insertion in model container [2024-11-27 20:32:09,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:32:09" (3/3) ... [2024-11-27 20:32:09,305 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2.c [2024-11-27 20:32:09,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:32:09,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:32:09,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:32:09,411 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;@146a084c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:32:09,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:32:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:32:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:32:09,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:09,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:09,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1574874756, now seen corresponding path program 1 times [2024-11-27 20:32:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:32:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892578238] [2024-11-27 20:32:09,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:09,454 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 20:32:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:32:09,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:09,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:10,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:32:10,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:32:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:32:10,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:32:10,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:32:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892578238] [2024-11-27 20:32:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892578238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:10,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:32:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154896171] [2024-11-27 20:32:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:32:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:32:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:32:10,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:32:10,990 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 20:32:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:11,012 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-11-27 20:32:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:32:11,015 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-11-27 20:32:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:11,021 INFO L225 Difference]: With dead ends: 39 [2024-11-27 20:32:11,021 INFO L226 Difference]: Without dead ends: 17 [2024-11-27 20:32:11,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 20:32:11,027 INFO L435 NwaCegarLoop]: 23 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, 23 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 20:32:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:32:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-27 20:32:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-27 20:32:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:32:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-27 20:32:11,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-27 20:32:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:11,069 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-27 20:32:11,070 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 20:32:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-27 20:32:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:32:11,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:11,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:11,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:11,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 77289850, now seen corresponding path program 1 times [2024-11-27 20:32:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:32:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348017934] [2024-11-27 20:32:11,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:11,282 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 20:32:11,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:32:11,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:11,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:32:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:20,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 20:32:20,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:32:32,612 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:32:40,786 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 20:32:48,876 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:32:57,058 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:33:05,150 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:33:13,330 WARN L286 SmtUtils]: Spent 8.18s 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 20:33:21,531 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:33:29,727 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:33:37,914 WARN L286 SmtUtils]: Spent 8.19s 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 20:33:46,116 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:33:54,461 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:02,549 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:10,718 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 20:34:18,977 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:27,156 WARN L286 SmtUtils]: Spent 8.18s 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 20:34:35,256 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:43,534 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:51,689 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:34:59,857 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:35:08,009 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 20:35:16,176 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:35:24,340 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 20:35:36,590 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:35:44,753 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:35:52,921 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:36:01,093 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 20:36:09,278 WARN L286 SmtUtils]: Spent 8.18s 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 20:36:17,432 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:36:25,577 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 20:36:33,749 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:36:50,121 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:36:58,219 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:37:06,396 WARN L286 SmtUtils]: Spent 8.18s 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 20:37:18,830 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:37:27,021 WARN L286 SmtUtils]: Spent 8.19s 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 20:37:35,118 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:37:39,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse6 (fp.neg .cse7)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse5 (fp.mul roundNearestTiesToEven .cse9 .cse1))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse7)))))))))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq .cse8 .cse7) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq .cse8 .cse6) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-27 20:37:51,589 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:37:59,683 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:38:07,874 WARN L286 SmtUtils]: Spent 8.19s 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 20:38:20,284 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:38:28,484 WARN L286 SmtUtils]: Spent 8.20s 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 20:38:36,582 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:38:40,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse5 (fp.mul roundNearestTiesToEven .cse7 .cse1)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (or (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) (fp.neg .cse6))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse6))))))))))) is different from false [2024-11-27 20:38:44,698 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse5 (fp.mul roundNearestTiesToEven .cse7 .cse1)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (or (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) (fp.neg .cse6))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse6))))))))))) is different from true [2024-11-27 20:38:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 20:38:44,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:38:44,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:38:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348017934] [2024-11-27 20:38:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348017934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:38:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:38:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:38:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745053102] [2024-11-27 20:38:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:38:44,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:38:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:38:44,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:38:44,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2024-11-27 20:38:44,704 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:38:50,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:38:54,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:38:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:02,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:06,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:10,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:14,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse6 (fp.neg .cse7)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse5 (fp.mul roundNearestTiesToEven .cse9 .cse1))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5) .cse7)))))))))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| .cse3)) .cse4) .cse5))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq .cse8 .cse7) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse0) (fp.geq .cse8 .cse6) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse10) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse10) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-27 20:39:18,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:22,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:26,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:30,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:34,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:38,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:42,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:46,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:39:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:46,811 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-27 20:39:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:39:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-11-27 20:39:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:46,971 INFO L225 Difference]: With dead ends: 28 [2024-11-27 20:39:46,971 INFO L226 Difference]: Without dead ends: 26 [2024-11-27 20:39:46,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=37, Invalid=61, Unknown=4, NotChecked=54, Total=156 [2024-11-27 20:39:46,973 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 57.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:39:46,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 14 Unknown, 65 Unchecked, 57.8s Time] [2024-11-27 20:39:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-27 20:39:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-27 20:39:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:39:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-27 20:39:46,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2024-11-27 20:39:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:46,983 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-27 20:39:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:39:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-27 20:39:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-27 20:39:46,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:46,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:47,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:39:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:39:47,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1140851369, now seen corresponding path program 1 times [2024-11-27 20:39:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151947800] [2024-11-27 20:39:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:47,187 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 20:39:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:39:47,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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 20:39:47,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_888b7902-4599-4672-8c06-62cb718344c8/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