java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/inv_Newton_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:45:30,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:45:30,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:45:30,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:45:30,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:45:30,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:45:30,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:45:30,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:45:30,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:45:30,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:45:30,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:45:30,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:45:30,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:45:30,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:45:30,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:45:30,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:45:30,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:45:30,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:45:30,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:45:30,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:45:30,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:45:30,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:45:30,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:45:30,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:45:30,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:45:30,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:45:30,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:45:30,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:45:30,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:45:30,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:45:30,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:45:30,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:45:30,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:45:30,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:45:30,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:45:30,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:45:30,146 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:45:30,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:45:30,162 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:45:30,163 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:45:30,163 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:45:30,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:45:30,164 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:45:30,164 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:45:30,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:45:30,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:45:30,166 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:45:30,166 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:45:30,166 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:45:30,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:45:30,166 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:45:30,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:45:30,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:45:30,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:45:30,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:45:30,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:45:30,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:45:30,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:45:30,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:45:30,168 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:45:30,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:45:30,169 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:45:30,169 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:45:30,169 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:45:30,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:45:30,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:45:30,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:45:30,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:45:30,236 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:45:30,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/inv_Newton_true-unreach-call.c [2018-09-19 15:45:30,582 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e1ff61c/280eaa376f2e480a90a9d2c3cccad0d9/FLAG39b9d71db [2018-09-19 15:45:30,746 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:45:30,747 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/inv_Newton_true-unreach-call.c [2018-09-19 15:45:30,754 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e1ff61c/280eaa376f2e480a90a9d2c3cccad0d9/FLAG39b9d71db [2018-09-19 15:45:30,769 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e1ff61c/280eaa376f2e480a90a9d2c3cccad0d9 [2018-09-19 15:45:30,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:45:30,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:45:30,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:45:30,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:45:30,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:45:30,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:45:30" (1/1) ... [2018-09-19 15:45:30,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1ba306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:30, skipping insertion in model container [2018-09-19 15:45:30,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:45:30" (1/1) ... [2018-09-19 15:45:30,809 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:45:31,052 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:45:31,079 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:45:31,099 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:45:31,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31 WrapperNode [2018-09-19 15:45:31,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:45:31,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:45:31,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:45:31,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:45:31,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... [2018-09-19 15:45:31,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:45:31,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:45:31,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:45:31,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:45:31,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:45:31,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:45:31,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:45:31,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:45:31,369 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-09-19 15:45:31,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:45:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:45:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:45:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:45:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:45:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-09-19 15:45:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 15:45:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 15:45:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-09-19 15:45:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-09-19 15:45:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 15:45:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 15:45:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:45:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:45:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:45:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-09-19 15:45:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 15:45:31,735 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:45:31,770 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:45:31,788 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:45:33,984 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:45:33,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:45:33 BoogieIcfgContainer [2018-09-19 15:45:33,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:45:33,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:45:33,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:45:33,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:45:33,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:45:30" (1/3) ... [2018-09-19 15:45:33,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd30c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:45:33, skipping insertion in model container [2018-09-19 15:45:33,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:31" (2/3) ... [2018-09-19 15:45:33,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd30c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:45:33, skipping insertion in model container [2018-09-19 15:45:33,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:45:33" (3/3) ... [2018-09-19 15:45:34,000 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-09-19 15:45:34,013 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:45:34,023 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:45:34,088 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:45:34,089 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:45:34,089 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:45:34,089 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:45:34,090 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:45:34,090 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:45:34,090 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:45:34,090 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:45:34,091 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:45:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-09-19 15:45:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 15:45:34,117 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:45:34,119 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:45:34,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:45:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash 688158535, now seen corresponding path program 1 times [2018-09-19 15:45:34,133 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:45:34,134 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:45:34,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:45:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:45:34,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:45:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:45:34,299 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:45:34,315 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:45:34,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:45:34,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:45:34,333 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:45:34,334 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:45:34,337 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-09-19 15:45:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:45:34,362 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-09-19 15:45:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:45:34,364 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-09-19 15:45:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:45:34,373 INFO L225 Difference]: With dead ends: 63 [2018-09-19 15:45:34,373 INFO L226 Difference]: Without dead ends: 36 [2018-09-19 15:45:34,377 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:45:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-19 15:45:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-19 15:45:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-19 15:45:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-19 15:45:34,417 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-19 15:45:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:45:34,418 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-19 15:45:34,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:45:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-19 15:45:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 15:45:34,420 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:45:34,420 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:45:34,420 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:45:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1702424640, now seen corresponding path program 1 times [2018-09-19 15:45:34,422 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:45:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:45:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:45:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:45:34,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:45:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:45:34,574 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:45:34,592 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:45:34,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:45:34,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:45:34,596 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:45:34,596 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:45:34,596 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 3 states. [2018-09-19 15:45:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:45:37,006 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-19 15:45:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:45:37,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-09-19 15:45:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:45:37,009 INFO L225 Difference]: With dead ends: 51 [2018-09-19 15:45:37,009 INFO L226 Difference]: Without dead ends: 38 [2018-09-19 15:45:37,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:45:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-19 15:45:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-19 15:45:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-19 15:45:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-19 15:45:37,019 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-19 15:45:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:45:37,020 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-19 15:45:37,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:45:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-19 15:45:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-19 15:45:37,021 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:45:37,022 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:45:37,022 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:45:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1294532058, now seen corresponding path program 1 times [2018-09-19 15:45:37,023 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:45:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:45:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:45:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:45:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:45:38,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 15:45:38,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 15:45:38,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:38,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:38,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:38,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-19 15:45:38,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-09-19 15:45:38,539 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:45:38,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-09-19 15:45:38,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:38,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:38,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:38,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:19 [2018-09-19 15:45:39,362 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:39,363 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:39,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 103 [2018-09-19 15:45:39,384 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:45:39,476 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-09-19 15:45:39,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2018-09-19 15:45:39,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:39,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:39,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:39,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:65 [2018-09-19 15:45:39,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 82 [2018-09-19 15:45:39,851 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:45:39,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 130 [2018-09-19 15:45:39,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:39,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:39,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 15:45:39,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:110, output treesize:136 [2018-09-19 15:46:17,407 WARN L178 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 15:46:59,256 WARN L178 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 15:47:01,371 WARN L797 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse1) (fp.mul RNE (fp.mul RNE .cse0 .cse1) .cse1)))) (fp.geq .cse0 ((_ to_fp 11 53) RNE 20.0))))) is different from false [2018-09-19 15:47:03,460 WARN L819 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse1) (fp.mul RNE (fp.mul RNE .cse0 .cse1) .cse1)))) (fp.geq .cse0 ((_ to_fp 11 53) RNE 20.0))))) is different from true [2018-09-19 15:47:05,560 WARN L797 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE 20.0)) (= (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse1) (fp.mul RNE (fp.mul RNE .cse0 .cse1) .cse1))) c_main_~r~0)))) is different from false [2018-09-19 15:47:07,644 WARN L819 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE 20.0)) (= (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse1) (fp.mul RNE (fp.mul RNE .cse0 .cse1) .cse1))) c_main_~r~0)))) is different from true [2018-09-19 15:47:24,578 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_4) v_prenex_6) (_ bv9218868437227405312 64)) .cse5)) (_ bv4294966273 32)))) .cse5)))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse2) (fp.mul RNE (fp.mul RNE .cse0 .cse2) .cse2))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE 20.0)) (fp.geq .cse1 ((_ to_fp 11 53) RNE (_ bv0 32))) (fp.leq .cse1 ((_ to_fp 11 53) RNE (/ 3.0 50.0))) (fp.leq .cse0 ((_ to_fp 11 53) RNE 30.0))))))) (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse6 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse6 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse10)) (_ bv4294966273 32)))) .cse10)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse7) (fp.mul RNE (fp.mul RNE .cse6 .cse7) .cse7))) ((_ to_fp 11 53) RNE (/ 3.0 50.0))))))) .cse11) (and (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (not (fp.geq (let ((.cse12 (let ((.cse14 (let ((.cse15 (let ((.cse16 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_1) v_prenex_3) (_ bv9218868437227405312 64)) .cse16)) (_ bv4294966273 32)))) .cse16)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse12) (fp.mul RNE (fp.mul RNE .cse13 .cse12) .cse12))) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq .cse13 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse13 ((_ to_fp 11 53) RNE 20.0))))) .cse11))) is different from false [2018-09-19 15:47:39,356 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse1 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse1 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse5)) (_ bv4294966273 32)))) .cse5)))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse2) (fp.mul RNE (fp.mul RNE .cse1 .cse2) .cse2))) ((_ to_fp 11 53) RNE (/ 3.0 50.0)))))))) (and (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_4) v_prenex_6) (_ bv9218868437227405312 64)) .cse11)) (_ bv4294966273 32)))) .cse11)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse8) (fp.mul RNE (fp.mul RNE .cse6 .cse8) .cse8))))) (and (fp.geq .cse6 ((_ to_fp 11 53) RNE 20.0)) (fp.geq .cse7 ((_ to_fp 11 53) RNE (_ bv0 32))) (fp.leq .cse7 ((_ to_fp 11 53) RNE (/ 3.0 50.0))) (fp.leq .cse6 ((_ to_fp 11 53) RNE 30.0)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (not (fp.geq (let ((.cse12 (let ((.cse14 (let ((.cse15 (let ((.cse16 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_1) v_prenex_3) (_ bv9218868437227405312 64)) .cse16)) (_ bv4294966273 32)))) .cse16)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse12) (fp.mul RNE (fp.mul RNE .cse13 .cse12) .cse12))) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq .cse13 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse13 ((_ to_fp 11 53) RNE 20.0)))))))) is different from false [2018-09-19 15:47:49,941 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (not (fp.geq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_1) v_prenex_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse0) (fp.mul RNE (fp.mul RNE .cse1 .cse0) .cse0))) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse1 ((_ to_fp 11 53) RNE 20.0))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse5 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse5 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse9)) (_ bv4294966273 32)))) .cse9)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse6) (fp.mul RNE (fp.mul RNE .cse5 .cse6) .cse6))) ((_ to_fp 11 53) RNE (/ 3.0 50.0)))))))) is different from false [2018-09-19 15:47:52,032 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (not (fp.geq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) v_prenex_1) v_prenex_3) (_ bv9218868437227405312 64)) .cse4)) (_ bv4294966273 32)))) .cse4)))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse0) (fp.mul RNE (fp.mul RNE .cse1 .cse0) .cse0))) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse1 ((_ to_fp 11 53) RNE 20.0))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)))) (and (fp.leq .cse5 ((_ to_fp 11 53) RNE 30.0)) (fp.geq .cse5 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvsub (_ bv1023 32) (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) v_arrayElimCell_3) (_ bv9218868437227405312 64)) .cse9)) (_ bv4294966273 32)))) .cse9)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse6) (fp.mul RNE (fp.mul RNE .cse5 .cse6) .cse6))) ((_ to_fp 11 53) RNE (/ 3.0 50.0)))))))) is different from true [2018-09-19 15:47:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:47:52,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:49:02,843 WARN L178 SmtUtils]: Spent 44.05 s on a formula simplification that was a NOOP. DAG size: 79 [2018-09-19 15:49:28,010 WARN L178 SmtUtils]: Spent 25.16 s on a formula simplification that was a NOOP. DAG size: 64 [2018-09-19 15:49:58,010 WARN L178 SmtUtils]: Spent 30.00 s on a formula simplification that was a NOOP. DAG size: 68 Received shutdown request... [2018-09-19 15:50:23,408 WARN L186 SmtUtils]: Removed 2 from assertion stack [2018-09-19 15:50:23,409 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:50:23,610 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2018-09-19 15:50:23,611 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:50:23,617 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:50:23,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:50:23 BoogieIcfgContainer [2018-09-19 15:50:23,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:50:23,619 INFO L168 Benchmark]: Toolchain (without parser) took 292838.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -560.0 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:50:23,620 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:50:23,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:50:23,621 INFO L168 Benchmark]: Boogie Preprocessor took 64.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:50:23,622 INFO L168 Benchmark]: RCFGBuilder took 2783.72 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:50:23,626 INFO L168 Benchmark]: TraceAbstraction took 289631.80 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 203.7 MB). Peak memory consumption was 203.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:50:23,632 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2783.72 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289631.80 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 203.7 MB). Peak memory consumption was 203.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. TIMEOUT Result, 289.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 32 SDs, 0 SdLazy, 2 SolverSat, 0 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 2517 SizeOfPredicates, 1 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown