./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.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_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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_536a216c-6b55-47c2-969e-6f59d27cea16/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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:39:11,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:39:11,962 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:39:11,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:39:11,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:39:12,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:39:12,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:39:12,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:39:12,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:39:12,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:39:12,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:39:12,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:39:12,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:39:12,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:39:12,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:39:12,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:39:12,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:39:12,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:39:12,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:39:12,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:39:12,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:39:12,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:39:12,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:12,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:12,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:12,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:12,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:39:12,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:12,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:12,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:39:12,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:39:12,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:39:12,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:39:12,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:39:12,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:39:12,009 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_536a216c-6b55-47c2-969e-6f59d27cea16/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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2024-11-28 03:39:12,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:39:12,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:39:12,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:39:12,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:39:12,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:39:12,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2024-11-28 03:39:15,503 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/085d03790/fc9c9abe2cd541e39a34c41bd9c2eca5/FLAGad6e8abf8 [2024-11-28 03:39:15,812 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:39:15,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c [2024-11-28 03:39:15,820 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/085d03790/fc9c9abe2cd541e39a34c41bd9c2eca5/FLAGad6e8abf8 [2024-11-28 03:39:15,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/085d03790/fc9c9abe2cd541e39a34c41bd9c2eca5 [2024-11-28 03:39:15,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:39:15,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:39:15,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:15,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:39:15,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:39:15,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:15" (1/1) ... [2024-11-28 03:39:15,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6773ee8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:15, skipping insertion in model container [2024-11-28 03:39:15,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:15" (1/1) ... [2024-11-28 03:39:15,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:39:16,025 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_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2024-11-28 03:39:16,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:16,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:39:16,058 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_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2024-11-28 03:39:16,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:16,075 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:39:16,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16 WrapperNode [2024-11-28 03:39:16,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:16,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:16,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:39:16,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:39:16,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,111 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2024-11-28 03:39:16,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:16,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:39:16,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:39:16,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:39:16,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,134 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:39:16,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:39:16,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:39:16,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:39:16,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:39:16,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (1/1) ... [2024-11-28 03:39:16,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:16,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:39:16,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:39:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:39:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:39:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:39:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:39:16,295 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:39:16,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:39:16,421 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-28 03:39:16,421 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:39:16,429 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:39:16,429 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:39:16,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:16 BoogieIcfgContainer [2024-11-28 03:39:16,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:39:16,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:39:16,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:39:16,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:39:16,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:15" (1/3) ... [2024-11-28 03:39:16,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:16, skipping insertion in model container [2024-11-28 03:39:16,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:16" (2/3) ... [2024-11-28 03:39:16,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:16, skipping insertion in model container [2024-11-28 03:39:16,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:16" (3/3) ... [2024-11-28 03:39:16,440 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2024-11-28 03:39:16,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:39:16,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_poly.c that has 1 procedures, 13 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-28 03:39:16,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:39:16,544 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;@5364fcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:39:16,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:39:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:39:16,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:16,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:16,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:39:16,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2024-11-28 03:39:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497432144] [2024-11-28 03:39:16,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:16,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497432144] [2024-11-28 03:39:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497432144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303301735] [2024-11-28 03:39:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:16,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:39:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:39:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:39:16,754 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:16,765 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-28 03:39:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:39:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:39:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:16,775 INFO L225 Difference]: With dead ends: 23 [2024-11-28 03:39:16,776 INFO L226 Difference]: Without dead ends: 9 [2024-11-28 03:39:16,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-28 03:39:16,782 INFO L435 NwaCegarLoop]: 13 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, 13 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-28 03:39:16,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:39:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-28 03:39:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-28 03:39:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-28 03:39:16,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2024-11-28 03:39:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:16,818 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-28 03:39:16,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-28 03:39:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:39:16,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:16,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:16,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:39:16,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:39:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2024-11-28 03:39:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423748561] [2024-11-28 03:39:16,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:39:16,843 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:39:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:39:16,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:39:16,890 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:39:16,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:39:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:39:16,898 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-28 03:39:16,916 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:39:16,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:39:16 BoogieIcfgContainer [2024-11-28 03:39:16,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:39:16,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:39:16,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:39:16,925 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:39:16,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:16" (3/4) ... [2024-11-28 03:39:16,930 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:39:16,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:39:16,932 INFO L158 Benchmark]: Toolchain (without parser) took 1091.28ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 51.4MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-28 03:39:16,932 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:39:16,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.53ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 83.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:39:16,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.04ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:39:16,933 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:39:16,934 INFO L158 Benchmark]: RCFGBuilder took 284.64ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 71.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:39:16,934 INFO L158 Benchmark]: TraceAbstraction took 492.34ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 51.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:39:16,934 INFO L158 Benchmark]: Witness Printer took 6.10ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 51.4MB in the end (delta: 373.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:39:16,936 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.36ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.53ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 83.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.04ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.64ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 71.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 492.34ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 51.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 6.10ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 51.4MB in the end (delta: 373.0kB). 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: 16]: 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 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of someBinaryDOUBLEComparisonOperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, 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, 13 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, 13 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:39:16,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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_536a216c-6b55-47c2-969e-6f59d27cea16/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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:39:19,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:39:20,131 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:39:20,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:39:20,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:39:20,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:39:20,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:39:20,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:39:20,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:39:20,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:39:20,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:39:20,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:39:20,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:39:20,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:39:20,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:39:20,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:39:20,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:39:20,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:39:20,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:39:20,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:39:20,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:39:20,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:39:20,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:39:20,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:39:20,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:39:20,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:20,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:20,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:20,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:20,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:39:20,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:20,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:20,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:20,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:20,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:39:20,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:39:20,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:39:20,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:39:20,174 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:39:20,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:39:20,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:39:20,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:39:20,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:39:20,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:39:20,175 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_536a216c-6b55-47c2-969e-6f59d27cea16/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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2024-11-28 03:39:20,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:39:20,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:39:20,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:39:20,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:39:20,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:39:20,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2024-11-28 03:39:23,594 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/33ddb3bf5/4d189bc4987c4c22a207b7a2bdad204e/FLAGcbe032147 [2024-11-28 03:39:23,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:39:23,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c [2024-11-28 03:39:23,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/33ddb3bf5/4d189bc4987c4c22a207b7a2bdad204e/FLAGcbe032147 [2024-11-28 03:39:23,913 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/data/33ddb3bf5/4d189bc4987c4c22a207b7a2bdad204e [2024-11-28 03:39:23,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:39:23,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:39:23,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:23,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:39:23,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:39:23,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:23" (1/1) ... [2024-11-28 03:39:23,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a298ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:23, skipping insertion in model container [2024-11-28 03:39:23,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:23" (1/1) ... [2024-11-28 03:39:23,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:39:24,143 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_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2024-11-28 03:39:24,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:24,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:39:24,206 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_536a216c-6b55-47c2-969e-6f59d27cea16/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2024-11-28 03:39:24,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:24,238 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:39:24,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24 WrapperNode [2024-11-28 03:39:24,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:24,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:24,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:39:24,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:39:24,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,301 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2024-11-28 03:39:24,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:24,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:39:24,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:39:24,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:39:24,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:39:24,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:39:24,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:39:24,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:39:24,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:39:24,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (1/1) ... [2024-11-28 03:39:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:24,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:24,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:39:24,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:39:24,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:39:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:39:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:39:24,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:39:24,534 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:39:24,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:39:32,990 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-28 03:39:32,990 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:39:33,001 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:39:33,001 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:39:33,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:33 BoogieIcfgContainer [2024-11-28 03:39:33,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:39:33,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:39:33,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:39:33,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:39:33,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:23" (1/3) ... [2024-11-28 03:39:33,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b324b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:33, skipping insertion in model container [2024-11-28 03:39:33,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:24" (2/3) ... [2024-11-28 03:39:33,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b324b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:33, skipping insertion in model container [2024-11-28 03:39:33,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:33" (3/3) ... [2024-11-28 03:39:33,015 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2024-11-28 03:39:33,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:39:33,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_poly.c that has 1 procedures, 13 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-28 03:39:33,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:39:33,123 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;@5566f74f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:39:33,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:39:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:39:33,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:33,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:33,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:39:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2024-11-28 03:39:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:39:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391155783] [2024-11-28 03:39:33,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:33,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:39:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:39:33,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:39:33,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-28 03:39:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:33,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:39:33,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:33,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:39:33,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:39:33,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391155783] [2024-11-28 03:39:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391155783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166242201] [2024-11-28 03:39:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:39:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:39:33,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:39:33,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:39:33,967 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:33,979 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-28 03:39:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:39:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:39:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:33,988 INFO L225 Difference]: With dead ends: 23 [2024-11-28 03:39:33,989 INFO L226 Difference]: Without dead ends: 9 [2024-11-28 03:39:33,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-28 03:39:33,995 INFO L435 NwaCegarLoop]: 13 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, 13 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-28 03:39:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:39:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-28 03:39:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-28 03:39:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-28 03:39:34,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2024-11-28 03:39:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:34,054 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-28 03:39:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:39:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-28 03:39:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:39:34,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:34,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:34,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-28 03:39:34,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:39:34,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:39:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2024-11-28 03:39:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:39:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10512872] [2024-11-28 03:39:34,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:39:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:39:34,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:39:34,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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-28 03:39:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:37,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:39:37,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:46,601 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:59,325 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:07,484 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:11,600 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:40:24,084 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:32,534 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:40,837 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:49,099 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:05,592 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:13,889 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:22,051 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:34,288 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:42,662 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:50,980 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:55,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse9)))))))) (and (fp.geq .cse8 .cse3) (fp.leq .cse8 .cse1) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-28 03:42:07,682 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:16,010 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:24,172 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:36,409 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:44,705 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:53,021 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:57,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1))))) is different from false [2024-11-28 03:43:01,221 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1))))) is different from true [2024-11-28 03:43:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:01,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:43:01,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:43:01,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10512872] [2024-11-28 03:43:01,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10512872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:01,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:43:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128057288] [2024-11-28 03:43:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:43:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:43:01,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:43:01,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2024-11-28 03:43:01,225 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:05,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:09,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:13,754 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-28 03:43:17,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)))) (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3))))))))))) (= c_~sqrt2~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:43:22,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:26,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:30,291 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-28 03:43:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:30,470 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-11-28 03:43:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:43:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:43:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:30,472 INFO L225 Difference]: With dead ends: 13 [2024-11-28 03:43:30,472 INFO L226 Difference]: Without dead ends: 9 [2024-11-28 03:43:30,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=17, Invalid=14, Unknown=5, NotChecked=36, Total=72 [2024-11-28 03:43:30,473 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:30,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 6 Unknown, 37 Unchecked, 25.0s Time] [2024-11-28 03:43:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-28 03:43:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-28 03:43:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2024-11-28 03:43:30,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8 [2024-11-28 03:43:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:30,477 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2024-11-28 03:43:30,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2024-11-28 03:43:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:43:30,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:30,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:30,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/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)] Ended with exit code 0 [2024-11-28 03:43:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:43:30,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:43:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times [2024-11-28 03:43:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:43:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388474639] [2024-11-28 03:43:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:43:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:43:30,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:43:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-28 03:44:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:44:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:44:31,317 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:39,626 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:52,715 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:56,853 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:45:13,480 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:21,837 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:30,041 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:42,557 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:50,755 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:59,118 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:11,679 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:20,060 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:28,438 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:36,820 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:41,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse3 .cse6))))))))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (fp.geq .cse1 .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)) (fp.leq .cse1 .cse2)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse7 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse7 .cse6))))))) .cse2)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse6))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)))))))) is different from false [2024-11-28 03:46:53,660 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:02,072 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:10,283 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:22,736 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:30,929 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:39,293 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:43,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse1)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)))))) is different from false [2024-11-28 03:47:47,523 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse1)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)))))) is different from true [2024-11-28 03:47:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:47,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:47:47,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:47:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388474639] [2024-11-28 03:47:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388474639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:47:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272561038] [2024-11-28 03:47:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:47:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:47:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:47:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2024-11-28 03:47:47,526 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:47:51,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:47:55,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:47:59,987 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-28 03:47:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:59,989 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2024-11-28 03:48:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:48:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:48:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:48:00,100 INFO L225 Difference]: With dead ends: 9 [2024-11-28 03:48:00,100 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 03:48:00,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2024-11-28 03:48:00,101 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:48:00,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 25 Unchecked, 12.5s Time] [2024-11-28 03:48:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 03:48:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 03:48:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:48:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 03:48:00,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-11-28 03:48:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:48:00,104 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 03:48:00,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:48:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 03:48:00,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 03:48:00,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:48:00,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-28 03:48:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:48:00,312 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-28 03:48:00,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-28 03:48:00,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:48:00,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:48:00 BoogieIcfgContainer [2024-11-28 03:48:00,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:48:00,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:48:00,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:48:00,333 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:48:00,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:33" (3/4) ... [2024-11-28 03:48:00,338 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 03:48:00,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-28 03:48:00,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 03:48:00,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 03:48:00,349 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 03:48:00,456 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:48:00,456 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:48:00,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:48:00,459 INFO L158 Benchmark]: Toolchain (without parser) took 516539.02ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 36.5MB in the end (delta: 24.4MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-28 03:48:00,459 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:48:00,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 49.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:48:00,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.41ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 48.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:48:00,460 INFO L158 Benchmark]: Boogie Preprocessor took 64.88ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:48:00,461 INFO L158 Benchmark]: RCFGBuilder took 8630.54ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 36.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:48:00,462 INFO L158 Benchmark]: TraceAbstraction took 507324.21ms. Allocated memory is still 83.9MB. Free memory was 36.2MB in the beginning and 41.5MB in the end (delta: -5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:48:00,462 INFO L158 Benchmark]: Witness Printer took 123.87ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 36.5MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:48:00,466 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.49ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 49.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.41ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 48.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.88ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 8630.54ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 36.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 507324.21ms. Allocated memory is still 83.9MB. Free memory was 36.2MB in the beginning and 41.5MB in the end (delta: -5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 123.87ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 36.5MB in the end (delta: 4.4MB). 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 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 507.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 37.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 37.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 54.1s SatisfiabilityAnalysisTime, 410.3s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 6 QuantifiedInterpolants, 1011 SizeOfPredicates, 3 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 03:48:00,683 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 03:48:00,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536a216c-6b55-47c2-969e-6f59d27cea16/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE