java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:43:43,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:43:43,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:43:43,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:43:43,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:43:43,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:43:43,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:43:43,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:43:43,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:43:43,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:43:43,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:43:43,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:43:43,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:43:43,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:43:43,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:43:43,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:43:43,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:43:43,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:43:43,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:43:43,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:43:43,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:43:43,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:43:43,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:43:43,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:43:43,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:43:43,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:43:43,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:43:43,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:43:43,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:43:43,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:43:43,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:43:43,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:43:43,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:43:43,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:43:43,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:43:43,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:43:43,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:43:43,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:43:43,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:43:43,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:43:43,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:43:43,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:43:43,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:43:43,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:43:43,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:43:43,889 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:43:43,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:43:43,890 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:43:43,890 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:43:43,890 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:43:43,890 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:43:43,891 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:43:43,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:43:43,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:43:43,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:43:43,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:43:43,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:43:43,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:43:43,893 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:43:43,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:43:43,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:43:43,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:43:43,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:43:43,894 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:43:43,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:43:43,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:43:43,895 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:43:43,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:43:43,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:43:43,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:43:43,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:43:43,943 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:43:43,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2019-09-10 01:43:44,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd549ddd3/9f35a35196da4f0cbe97bed51ba05122/FLAGd0b6089ae [2019-09-10 01:43:44,404 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:43:44,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2019-09-10 01:43:44,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd549ddd3/9f35a35196da4f0cbe97bed51ba05122/FLAGd0b6089ae [2019-09-10 01:43:44,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd549ddd3/9f35a35196da4f0cbe97bed51ba05122 [2019-09-10 01:43:44,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:43:44,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:43:44,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:43:44,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:43:44,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:43:44,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:43:44" (1/1) ... [2019-09-10 01:43:44,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b675fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:44, skipping insertion in model container [2019-09-10 01:43:44,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:43:44" (1/1) ... [2019-09-10 01:43:44,859 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:43:44,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:43:45,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:43:45,127 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:43:45,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:43:45,295 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:43:45,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45 WrapperNode [2019-09-10 01:43:45,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:43:45,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:43:45,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:43:45,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:43:45,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (1/1) ... [2019-09-10 01:43:45,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:43:45,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:43:45,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:43:45,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:43:45,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (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 [2019-09-10 01:43:45,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:43:45,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:43:45,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2019-09-10 01:43:45,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2019-09-10 01:43:45,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2019-09-10 01:43:45,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:43:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:43:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:43:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2019-09-10 01:43:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 01:43:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-10 01:43:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 01:43:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:43:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 01:43:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-10 01:43:45,756 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:43:45,756 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 01:43:45,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:43:45 BoogieIcfgContainer [2019-09-10 01:43:45,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:43:45,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:43:45,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:43:45,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:43:45,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:43:44" (1/3) ... [2019-09-10 01:43:45,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bfa14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:43:45, skipping insertion in model container [2019-09-10 01:43:45,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:43:45" (2/3) ... [2019-09-10 01:43:45,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bfa14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:43:45, skipping insertion in model container [2019-09-10 01:43:45,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:43:45" (3/3) ... [2019-09-10 01:43:45,765 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-09-10 01:43:45,774 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:43:45,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:43:45,798 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:43:45,824 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:43:45,824 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:43:45,824 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:43:45,825 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:43:45,825 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:43:45,825 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:43:45,825 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:43:45,825 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:43:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-10 01:43:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:43:45,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:45,848 INFO L399 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] [2019-09-10 01:43:45,850 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1213433904, now seen corresponding path program 1 times [2019-09-10 01:43:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:45,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:43:46,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:46,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:43:46,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:46,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:43:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:43:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,074 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2019-09-10 01:43:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:46,126 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-09-10 01:43:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:43:46,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:43:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:46,143 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:43:46,143 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:43:46,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:43:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 01:43:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:43:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-10 01:43:46,202 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 22 [2019-09-10 01:43:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:46,202 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-10 01:43:46,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:43:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-10 01:43:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:43:46,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:46,205 INFO L399 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] [2019-09-10 01:43:46,206 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:46,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 909602320, now seen corresponding path program 1 times [2019-09-10 01:43:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:43:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:43:46,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:46,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:43:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:43:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,307 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 4 states. [2019-09-10 01:43:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:46,356 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-10 01:43:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:43:46,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-09-10 01:43:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:46,359 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:43:46,359 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:43:46,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:43:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-09-10 01:43:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:43:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-10 01:43:46,369 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2019-09-10 01:43:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:46,369 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-10 01:43:46,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:43:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-10 01:43:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:43:46,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:46,371 INFO L399 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] [2019-09-10 01:43:46,372 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -887349039, now seen corresponding path program 1 times [2019-09-10 01:43:46,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:43:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:43:46,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:46,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:43:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:43:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:43:46,504 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 7 states. [2019-09-10 01:43:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:46,638 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-09-10 01:43:46,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:43:46,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 01:43:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:46,643 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:43:46,643 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:43:46,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:43:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:43:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 01:43:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 01:43:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-09-10 01:43:46,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 25 [2019-09-10 01:43:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:46,663 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-09-10 01:43:46,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:43:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-09-10 01:43:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:43:46,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:46,666 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:43:46,667 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -423203005, now seen corresponding path program 1 times [2019-09-10 01:43:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:43:46,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:46,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:43:46,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:46,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:43:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:43:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,784 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 4 states. [2019-09-10 01:43:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:46,814 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-09-10 01:43:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:43:46,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-09-10 01:43:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:46,818 INFO L225 Difference]: With dead ends: 50 [2019-09-10 01:43:46,818 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:43:46,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:43:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:43:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-10 01:43:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:43:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-09-10 01:43:46,834 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 30 [2019-09-10 01:43:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:46,836 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-09-10 01:43:46,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:43:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-09-10 01:43:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:43:46,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:46,838 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-10 01:43:46,838 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash 487792744, now seen corresponding path program 1 times [2019-09-10 01:43:46,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:46,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:46,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:43:46,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:46,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:43:46,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:46,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:43:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:43:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:43:46,982 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 5 states. [2019-09-10 01:43:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:47,036 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-09-10 01:43:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:43:47,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-10 01:43:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:47,039 INFO L225 Difference]: With dead ends: 53 [2019-09-10 01:43:47,039 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:43:47,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:43:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:43:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-10 01:43:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:43:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-10 01:43:47,051 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2019-09-10 01:43:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:47,052 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-10 01:43:47,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:43:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-10 01:43:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:43:47,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:47,055 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-10 01:43:47,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash -321553882, now seen corresponding path program 1 times [2019-09-10 01:43:47,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:47,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:47,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:43:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:43:47,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:43:47,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:43:47,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:43:47,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:43:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:43:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:43:47,183 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 8 states. [2019-09-10 01:43:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:43:47,282 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-10 01:43:47,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:43:47,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-10 01:43:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:43:47,284 INFO L225 Difference]: With dead ends: 54 [2019-09-10 01:43:47,284 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 01:43:47,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:43:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 01:43:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-10 01:43:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:43:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-10 01:43:47,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2019-09-10 01:43:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:43:47,292 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-10 01:43:47,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:43:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-10 01:43:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:43:47,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:43:47,293 INFO L399 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] [2019-09-10 01:43:47,293 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:43:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:43:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1884873230, now seen corresponding path program 1 times [2019-09-10 01:43:47,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:43:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:47,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:43:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:43:47,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:43:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:43:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:43:47,412 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:43:47,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:43:47 BoogieIcfgContainer [2019-09-10 01:43:47,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:43:47,474 INFO L168 Benchmark]: Toolchain (without parser) took 2633.06 ms. Allocated memory was 136.3 MB in the beginning and 230.2 MB in the end (delta: 93.8 MB). Free memory was 89.2 MB in the beginning and 151.9 MB in the end (delta: -62.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,474 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 136.3 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.95 ms. Allocated memory was 136.3 MB in the beginning and 202.4 MB in the end (delta: 66.1 MB). Free memory was 89.0 MB in the beginning and 179.0 MB in the end (delta: -90.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,476 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 176.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,477 INFO L168 Benchmark]: RCFGBuilder took 419.49 ms. Allocated memory is still 202.4 MB. Free memory was 176.6 MB in the beginning and 156.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,478 INFO L168 Benchmark]: TraceAbstraction took 1712.97 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 156.3 MB in the beginning and 151.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:43:47,482 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 136.3 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 451.95 ms. Allocated memory was 136.3 MB in the beginning and 202.4 MB in the end (delta: 66.1 MB). Free memory was 89.0 MB in the beginning and 179.0 MB in the end (delta: -90.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.09 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 176.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 419.49 ms. Allocated memory is still 202.4 MB. Free memory was 176.6 MB in the beginning and 156.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1712.97 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 156.3 MB in the beginning and 151.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 69. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; VAL [x=0, y=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0, \old(y)=0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=0, \result=0, lsw=4294967297, msw=4293918721, x=0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=0, __fpclassify_double(x)=0, x=0, y=0] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=0, \old(y)=0, \result=0, x=0, y=0] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0, x=0, y=0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=1, x=0, y=0] [L84] CALL, EXPR __signbit_double(res) VAL [\old(x)=0] [L61] __uint32_t msw; VAL [\old(x)=0, x=0] [L64] ieee_double_shape_type gh_u; [L65] gh_u.value = (x) [L66] EXPR gh_u.parts.msw [L66] (msw) = gh_u.parts.msw [L69] return (msw & 0x80000000) != 0; VAL [\old(x)=0, \result=1, msw=8, x=0] [L84] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=1, res=0, res == 0.0 && __signbit_double(res) == 0=1, x=0, y=0] [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [__signbit_double(res)=1, res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0, y=0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0, x=0, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 1.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 44 SDslu, 734 SDs, 0 SdLazy, 128 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 9738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...