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_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:39:59,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:39:59,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:39:59,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:39:59,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:39:59,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:39:59,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:39:59,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:39:59,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:39:59,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:39:59,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:39:59,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:39:59,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:39:59,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:39:59,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:39:59,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:39:59,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:39:59,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:39:59,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:39:59,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:39:59,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:39:59,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:39:59,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:39:59,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:39:59,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:39:59,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:39:59,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:39:59,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:39:59,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:39:59,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:39:59,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:39:59,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:39:59,884 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:39:59,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:39:59,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:39:59,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:39:59,886 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:39:59,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:39:59,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:39:59,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:39:59,922 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:39:59,923 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:39:59,923 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:39:59,924 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:39:59,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:39:59,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:39:59,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:39:59,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:39:59,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:39:59,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:39:59,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:39:59,925 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:39:59,925 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:39:59,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:39:59,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:39:59,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:39:59,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:39:59,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:39:59,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:39:59,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:39:59,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:39:59,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:39:59,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:39:59,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:39:59,929 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:39:59,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:39:59,929 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:39:59,930 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:39:59,930 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:39:59,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:40:00,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:40:00,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:40:00,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:40:00,021 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:40:00,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/inv_Newton_false-unreach-call.c [2018-09-19 15:40:00,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d14de120/fd383fa1e370448f824a0b37533a9013/FLAG39aa42462 [2018-09-19 15:40:00,583 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:40:00,584 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/inv_Newton_false-unreach-call.c [2018-09-19 15:40:00,602 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d14de120/fd383fa1e370448f824a0b37533a9013/FLAG39aa42462 [2018-09-19 15:40:00,627 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d14de120/fd383fa1e370448f824a0b37533a9013 [2018-09-19 15:40:00,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:40:00,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:40:00,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:00,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:40:00,657 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:40:00,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:00,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b726f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00, skipping insertion in model container [2018-09-19 15:40:00,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:00,676 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:40:00,909 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:00,930 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:40:00,946 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:01,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00 WrapperNode [2018-09-19 15:40:01,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:01,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:40:01,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:40:01,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:40:01,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (1/1) ... [2018-09-19 15:40:01,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:40:01,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:40:01,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:40:01,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:40:01,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (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:40:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:40:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:40:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:40:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-09-19 15:40:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:40:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:40:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:40:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 15:40:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:40:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 15:40:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 15:40:01,516 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:40:01,568 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:40:01,589 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:40:03,842 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:40:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:03 BoogieIcfgContainer [2018-09-19 15:40:03,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:40:03,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:40:03,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:40:03,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:40:03,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:40:00" (1/3) ... [2018-09-19 15:40:03,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd6530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:03, skipping insertion in model container [2018-09-19 15:40:03,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:00" (2/3) ... [2018-09-19 15:40:03,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd6530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:03, skipping insertion in model container [2018-09-19 15:40:03,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:03" (3/3) ... [2018-09-19 15:40:03,852 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_false-unreach-call.c [2018-09-19 15:40:03,862 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:40:03,871 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:40:03,925 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:40:03,926 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:40:03,926 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:40:03,926 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:40:03,926 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:40:03,927 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:40:03,927 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:40:03,927 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:40:03,927 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:40:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-09-19 15:40:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 15:40:03,953 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:03,955 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:40:03,957 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash 688158535, now seen corresponding path program 1 times [2018-09-19 15:40:03,969 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:03,970 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:40:03,986 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:40:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:04,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:04,149 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:40:04,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:04,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:04,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:40:04,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:40:04,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:40:04,187 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:40:04,189 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-09-19 15:40:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:04,212 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-09-19 15:40:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:40:04,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-09-19 15:40:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:04,224 INFO L225 Difference]: With dead ends: 63 [2018-09-19 15:40:04,224 INFO L226 Difference]: Without dead ends: 36 [2018-09-19 15:40:04,228 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:40:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-19 15:40:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-19 15:40:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-19 15:40:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-19 15:40:04,272 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-19 15:40:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:04,273 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-19 15:40:04,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:40:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-19 15:40:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 15:40:04,275 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:04,275 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:40:04,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1702424640, now seen corresponding path program 1 times [2018-09-19 15:40:04,277 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:04,277 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:40:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:40:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:04,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:04,450 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:40:04,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:04,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:04,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:40:04,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:40:04,466 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:40:04,467 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:40:04,467 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 3 states. [2018-09-19 15:40:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:06,806 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-19 15:40:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:40:06,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-09-19 15:40:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:06,808 INFO L225 Difference]: With dead ends: 51 [2018-09-19 15:40:06,808 INFO L226 Difference]: Without dead ends: 38 [2018-09-19 15:40:06,809 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:40:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-19 15:40:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-19 15:40:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-19 15:40:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-19 15:40:06,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-19 15:40:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:06,818 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-19 15:40:06,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:40:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-19 15:40:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-19 15:40:06,820 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:06,820 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:40:06,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1294532058, now seen corresponding path program 1 times [2018-09-19 15:40:06,821 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:06,821 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) [2018-09-19 15:40:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:08,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:08,568 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:40:08,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:40:08,588 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 27 treesize of output 35 [2018-09-19 15:40:08,610 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:40:08,616 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:40:08,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-09-19 15:40:08,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:40:08,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:40:08,917 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:40:08,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-09-19 15:40:09,100 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 34 treesize of output 27 [2018-09-19 15:40:09,225 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:40:09,256 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:40:09,303 INFO L303 Elim1Store]: Index analysis took 198 ms [2018-09-19 15:40:09,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-09-19 15:40:09,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:40:09,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:40:09,514 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:40:09,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2018-09-19 15:40:09,659 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 67 treesize of output 51 [2018-09-19 15:40:09,708 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:40:09,731 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 51 treesize of output 37 [2018-09-19 15:40:09,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:40:09,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:40:09,842 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:40:09,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:45 [2018-09-19 15:40:10,136 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 15:40:10,432 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 15:40:12,568 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 (= (bvadd c_inv_~cond~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_5 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_prenex_6) (bvshl (bvsub (_ bv1023 32) v_prenex_5) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.lt (fp.sub RNE c_inv_~xi~0 .cse0) (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (= c_inv_~xi~0 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse0) (fp.mul RNE (fp.mul RNE |c_inv_#in~A| .cse0) .cse0))) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)))))) .cse2) (and .cse2 (exists ((v_prenex_2 (_ BitVec 64)) (v_prenex_1 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_prenex_2) (bvshl (bvsub (_ bv1023 32) v_prenex_1) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (and (fp.gt (fp.sub RNE c_inv_~xi~0 .cse3) ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0))) (= c_inv_~xi~0 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse3) (fp.mul RNE (fp.mul RNE |c_inv_#in~A| .cse3) .cse3))) (= (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2)) ((_ to_fp 11 53) RNE (_ bv1 32))))))) (and (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64))) (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse5 (fp.sub RNE c_inv_~xi~0 .cse7)) (.cse6 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.gt .cse5 .cse6)) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse7) (fp.mul RNE (fp.mul RNE |c_inv_#in~A| .cse7) .cse7)) c_inv_~xi~0) (not (fp.lt .cse5 (fp.neg .cse6))))))) (= c_inv_~cond~0 (_ bv0 32))))) is different from false [2018-09-19 15:40:14,700 WARN L797 $PredicateComparison]: unable to prove that (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub RNE c_inv_~xi~0 .cse2)) (.cse1 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.gt .cse0 .cse1)) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse2) (fp.mul RNE (fp.mul RNE |c_inv_#in~A| .cse2) .cse2)) c_inv_~xi~0) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2018-09-19 15:40:16,983 WARN L797 $PredicateComparison]: unable to prove that (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub RNE |c_inv_#res| .cse2)) (.cse1 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.lt .cse0 (fp.neg .cse1))) (= |c_inv_#res| (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse2) (fp.mul RNE (fp.mul RNE |c_inv_#in~A| .cse2) .cse2))) (not (fp.gt .cse0 .cse1)))))) is different from false [2018-09-19 15:40:19,275 WARN L797 $PredicateComparison]: unable to prove that (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub RNE |c_main_#t~ret5| .cse2)) (.cse1 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (= |c_main_#t~ret5| (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse2) (fp.mul RNE (fp.mul RNE main_~a~0 .cse2) .cse2))))))) is different from false [2018-09-19 15:40:21,670 WARN L797 $PredicateComparison]: unable to prove that (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse1 (fp.sub RNE c_main_~r~0 .cse0)) (.cse2 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse0) (fp.mul RNE (fp.mul RNE main_~a~0 .cse0) .cse0)) c_main_~r~0) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)))))) is different from false [2018-09-19 15:40:35,966 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse1 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse4) (fp.mul RNE (fp.mul RNE main_~a~0 .cse4) .cse4)))) (let ((.cse2 (fp.sub RNE .cse1 .cse4)) (.cse3 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.geq .cse1 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (not (fp.gt .cse2 .cse3)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse2 (fp.neg .cse3))))))))) (and (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) v_prenex_10) (bvshl (bvsub (_ bv1023 32) v_prenex_9) (_ bv20 32))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse9) (fp.mul RNE (fp.mul RNE v_prenex_11 .cse9) .cse9)))) (let ((.cse6 (fp.sub RNE .cse8 .cse9)) (.cse7 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse6 .cse7)) (fp.leq v_prenex_11 ((_ to_fp 11 53) RNE 30.0)) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (not (fp.leq .cse8 ((_ to_fp 11 53) RNE (/ 3.0 50.0)))) (fp.geq v_prenex_11 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse6 (fp.neg .cse7)))))))) .cse0))) is different from false [2018-09-19 15:40:46,624 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse1 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse4) (fp.mul RNE (fp.mul RNE main_~a~0 .cse4) .cse4)))) (let ((.cse2 (fp.sub RNE .cse1 .cse4)) (.cse3 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.geq .cse1 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (not (fp.gt .cse2 .cse3)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse2 (fp.neg .cse3))))))))) (and .cse0 (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) v_prenex_10) (bvshl (bvsub (_ bv1023 32) v_prenex_9) (_ bv20 32))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse9) (fp.mul RNE (fp.mul RNE v_prenex_11 .cse9) .cse9)))) (let ((.cse6 (fp.sub RNE .cse8 .cse9)) (.cse7 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse6 .cse7)) (fp.leq v_prenex_11 ((_ to_fp 11 53) RNE 30.0)) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (not (fp.leq .cse8 ((_ to_fp 11 53) RNE (/ 3.0 50.0)))) (fp.geq v_prenex_11 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse6 (fp.neg .cse7))))))))))) is different from false [2018-09-19 15:40:57,310 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_prenex_10) (bvshl (bvsub (_ bv1023 32) v_prenex_9) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse3) (fp.mul RNE (fp.mul RNE v_prenex_11 .cse3) .cse3)))) (let ((.cse0 (fp.sub RNE .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (fp.leq v_prenex_11 ((_ to_fp 11 53) RNE 30.0)) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (not (fp.leq .cse2 ((_ to_fp 11 53) RNE (/ 3.0 50.0)))) (fp.geq v_prenex_11 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse5 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse8) (fp.mul RNE (fp.mul RNE main_~a~0 .cse8) .cse8)))) (let ((.cse6 (fp.sub RNE .cse5 .cse8)) (.cse7 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.geq .cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (not (fp.gt .cse6 .cse7)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse6 (fp.neg .cse7))))))))) is different from false [2018-09-19 15:40:59,403 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_prenex_10) (bvshl (bvsub (_ bv1023 32) v_prenex_9) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse3) (fp.mul RNE (fp.mul RNE v_prenex_11 .cse3) .cse3)))) (let ((.cse0 (fp.sub RNE .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (fp.leq v_prenex_11 ((_ to_fp 11 53) RNE 30.0)) (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (not (fp.leq .cse2 ((_ to_fp 11 53) RNE (/ 3.0 50.0)))) (fp.geq v_prenex_11 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) (exists ((inv_~exp~0 (_ BitVec 32)) (|v_q#valueAsBitvector_4| (_ BitVec 64)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) |v_q#valueAsBitvector_4|) (bvshl (bvsub (_ bv1023 32) inv_~exp~0) (_ bv20 32))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse5 (fp.sub RNE (fp.mul RNE ((_ to_fp 11 53) RNE (_ bv2 32)) .cse8) (fp.mul RNE (fp.mul RNE main_~a~0 .cse8) .cse8)))) (let ((.cse6 (fp.sub RNE .cse5 .cse8)) (.cse7 ((_ to_fp 11 53) RNE (/ 1.0 10000000000.0)))) (and (= ((_ to_fp 11 53) RNE (_ bv1 32)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (not (fp.geq .cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq main_~a~0 ((_ to_fp 11 53) RNE 30.0)) (not (fp.gt .cse6 .cse7)) (fp.geq main_~a~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.lt .cse6 (fp.neg .cse7))))))))) is different from true [2018-09-19 15:40:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-19 15:40:59,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:42:00,450 WARN L178 SmtUtils]: Spent 1.01 m on a formula simplification that was a NOOP. DAG size: 76 [2018-09-19 15:42:41,725 WARN L178 SmtUtils]: Spent 41.27 s on a formula simplification that was a NOOP. DAG size: 64 [2018-09-19 15:43:20,905 WARN L178 SmtUtils]: Spent 39.18 s on a formula simplification that was a NOOP. DAG size: 68 [2018-09-19 15:44:09,253 WARN L178 SmtUtils]: Spent 48.35 s on a formula simplification that was a NOOP. DAG size: 68 [2018-09-19 15:44:13,559 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ((_ extract 63 32) v_prenex_15) (select (select v_prenex_17 v_prenex_13) (bvadd v_prenex_14 (_ bv4 32)))) [2018-09-19 15:44:13,560 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:44:15,565 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select (select v_prenex_17 v_prenex_13) v_prenex_14) ((_ extract 31 0) v_prenex_15)) [2018-09-19 15:44:15,566 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 15:44:15,699 INFO L303 Elim1Store]: Index analysis took 6431 ms [2018-09-19 15:44:15,700 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 992 treesize of output 944 [2018-09-19 15:44:17,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:44:17,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:44:18,104 INFO L303 Elim1Store]: Index analysis took 2398 ms [2018-09-19 15:44:18,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 928 treesize of output 796 [2018-09-19 15:44:18,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-09-19 15:44:53,157 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:44:53,358 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2018-09-19 15:44:53,358 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:44:53,364 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:44:53,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:44:53 BoogieIcfgContainer [2018-09-19 15:44:53,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:44:53,366 INFO L168 Benchmark]: Toolchain (without parser) took 292723.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -584.4 MB). Peak memory consumption was 154.8 MB. Max. memory is 7.1 GB. [2018-09-19 15:44:53,368 INFO L168 Benchmark]: CDTParser took 0.27 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:44:53,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.91 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:44:53,369 INFO L168 Benchmark]: Boogie Preprocessor took 71.42 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:44:53,370 INFO L168 Benchmark]: RCFGBuilder took 2770.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:44:53,371 INFO L168 Benchmark]: TraceAbstraction took 289521.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:44:53,375 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.27 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 353.91 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 71.42 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 2770.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289521.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. TIMEOUT Result, 289.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 2.3s 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.2s 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.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 2517 SizeOfPredicates, 1 NumberOfNonLiveVariables, 149 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