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/bitvector/soft_float_4-2.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:45:10,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:45:10,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:45:10,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:45:10,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:45:10,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:45:10,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:45:10,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:45:10,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:45:10,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:45:10,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:45:10,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:45:10,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:45:10,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:45:10,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:45:10,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:45:10,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:45:10,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:45:10,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:45:10,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:45:10,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:45:10,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:45:10,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:45:10,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:45:10,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:45:10,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:45:10,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:45:10,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:45:10,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:45:10,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:45:10,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:45:10,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:45:10,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:45:10,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:45:10,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:45:10,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:45:10,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:45:10,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:45:10,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:45:10,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:45:10,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:45:10,800 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-09 05:45:10,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:45:10,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:45:10,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:45:10,828 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:45:10,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:45:10,829 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:45:10,829 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:45:10,829 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:45:10,829 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:45:10,830 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:45:10,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:45:10,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:45:10,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:45:10,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:45:10,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:45:10,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:45:10,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:45:10,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:45:10,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:45:10,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:45:10,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:45:10,834 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:45:10,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:45:10,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:10,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:45:10,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:45:10,835 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:45:10,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:45:10,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:45:10,835 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:45:10,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:45:10,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:45:10,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:45:10,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:45:10,891 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:45:10,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_4-2.c.cil.c [2019-09-09 05:45:10,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8c236fb/c715c58747a4429e9d8383981618ab2f/FLAGf4f228ba9 [2019-09-09 05:45:11,434 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:45:11,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_4-2.c.cil.c [2019-09-09 05:45:11,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8c236fb/c715c58747a4429e9d8383981618ab2f/FLAGf4f228ba9 [2019-09-09 05:45:11,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8c236fb/c715c58747a4429e9d8383981618ab2f [2019-09-09 05:45:11,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:45:11,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:45:11,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:11,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:45:11,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:45:11,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:11" (1/1) ... [2019-09-09 05:45:11,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7421412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:11, skipping insertion in model container [2019-09-09 05:45:11,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:11" (1/1) ... [2019-09-09 05:45:11,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:45:11,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:45:12,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:12,332 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:45:12,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:12,389 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:45:12,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12 WrapperNode [2019-09-09 05:45:12,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:12,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:45:12,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:45:12,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:45:12,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (1/1) ... [2019-09-09 05:45:12,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:45:12,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:45:12,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:45:12,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:45:12,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (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-09 05:45:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:45:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:45:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:45:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2019-09-09 05:45:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2019-09-09 05:45:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2019-09-09 05:45:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:45:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:45:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-09 05:45:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:45:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:45:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:45:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:45:12,976 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:45:12,977 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:45:12,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:12 BoogieIcfgContainer [2019-09-09 05:45:12,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:45:12,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:45:12,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:45:12,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:45:12,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:45:11" (1/3) ... [2019-09-09 05:45:12,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c93fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:12, skipping insertion in model container [2019-09-09 05:45:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:12" (2/3) ... [2019-09-09 05:45:12,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c93fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:12, skipping insertion in model container [2019-09-09 05:45:12,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:12" (3/3) ... [2019-09-09 05:45:12,986 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2019-09-09 05:45:12,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:45:13,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:45:13,018 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:45:13,044 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:45:13,045 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:45:13,045 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:45:13,045 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:45:13,045 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:45:13,046 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:45:13,046 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:45:13,046 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:45:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-09-09 05:45:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:45:13,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:13,072 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:13,073 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1739961404, now seen corresponding path program 1 times [2019-09-09 05:45:13,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:13,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:13,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:13,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-09 05:45:13,480 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [111], [113], [115], [117], [138], [141], [143], [149], [152], [160], [188], [189], [190], [192], [193], [194], [195], [196], [197], [198], [204] [2019-09-09 05:45:13,527 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:13,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:13,648 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:13,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:13,691 INFO L272 AbstractInterpreter]: Visited 26 different actions 34 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 6. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 19 variables. [2019-09-09 05:45:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:13,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:13,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:13,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:13,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:13,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-09 05:45:13,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:45:13,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:14,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:14,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2019-09-09 05:45:14,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:14,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:45:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:45:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:14,163 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 12 states. [2019-09-09 05:45:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:14,692 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2019-09-09 05:45:14,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 05:45:14,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-09-09 05:45:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:14,710 INFO L225 Difference]: With dead ends: 103 [2019-09-09 05:45:14,710 INFO L226 Difference]: Without dead ends: 95 [2019-09-09 05:45:14,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:45:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-09 05:45:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2019-09-09 05:45:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-09 05:45:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2019-09-09 05:45:14,777 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 34 [2019-09-09 05:45:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:14,778 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2019-09-09 05:45:14,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:45:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2019-09-09 05:45:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-09 05:45:14,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:14,782 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-09 05:45:14,782 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1925414387, now seen corresponding path program 1 times [2019-09-09 05:45:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:14,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:14,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2019-09-09 05:45:14,993 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [111], [113], [115], [117], [138], [141], [143], [149], [152], [160], [188], [189], [190], [192], [193], [194], [195], [196], [197], [198], [204] [2019-09-09 05:45:15,001 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:15,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:15,007 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:15,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:15,122 INFO L272 AbstractInterpreter]: Visited 31 different actions 88 times. Merged at 7 different actions 15 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 6. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2019-09-09 05:45:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:15,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:15,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:15,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:15,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:15,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:15,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:15,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:45:15,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:15,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 10] total 22 [2019-09-09 05:45:15,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:15,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-09-09 05:45:15,611 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 8 states. [2019-09-09 05:45:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:17,833 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2019-09-09 05:45:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:45:17,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-09-09 05:45:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:17,837 INFO L225 Difference]: With dead ends: 95 [2019-09-09 05:45:17,837 INFO L226 Difference]: Without dead ends: 95 [2019-09-09 05:45:17,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-09-09 05:45:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-09 05:45:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-09-09 05:45:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-09 05:45:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2019-09-09 05:45:17,854 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 38 [2019-09-09 05:45:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:17,863 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2019-09-09 05:45:17,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2019-09-09 05:45:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-09 05:45:17,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:17,866 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-09 05:45:17,867 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1982672689, now seen corresponding path program 1 times [2019-09-09 05:45:17,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:18,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:45:18,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:18,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:18,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:18,083 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand 8 states. [2019-09-09 05:45:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:18,175 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2019-09-09 05:45:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:18,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-09-09 05:45:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:18,179 INFO L225 Difference]: With dead ends: 95 [2019-09-09 05:45:18,179 INFO L226 Difference]: Without dead ends: 95 [2019-09-09 05:45:18,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-09 05:45:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-09-09 05:45:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-09 05:45:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2019-09-09 05:45:18,195 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 38 [2019-09-09 05:45:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:18,195 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2019-09-09 05:45:18,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2019-09-09 05:45:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:45:18,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:18,198 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-09 05:45:18,198 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 428599846, now seen corresponding path program 1 times [2019-09-09 05:45:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:18,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:45:18,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:18,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:45:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:45:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:45:18,447 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand 9 states. [2019-09-09 05:45:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:18,599 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-09-09 05:45:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:45:18,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-09 05:45:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:18,602 INFO L225 Difference]: With dead ends: 101 [2019-09-09 05:45:18,602 INFO L226 Difference]: Without dead ends: 101 [2019-09-09 05:45:18,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:45:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-09 05:45:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2019-09-09 05:45:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-09 05:45:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-09-09 05:45:18,614 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 42 [2019-09-09 05:45:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:18,614 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-09-09 05:45:18,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:45:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-09-09 05:45:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:45:18,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:18,617 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2019-09-09 05:45:18,617 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 485858148, now seen corresponding path program 1 times [2019-09-09 05:45:18,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:18,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:18,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:18,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2019-09-09 05:45:18,739 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [111], [113], [115], [117], [119], [138], [141], [143], [149], [154], [158], [160], [182], [183], [188], [189], [190], [192], [193], [194], [195], [196], [197], [198], [199], [200], [204] [2019-09-09 05:45:18,746 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:18,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:18,750 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:18,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:18,765 INFO L272 AbstractInterpreter]: Visited 32 different actions 50 times. Never merged. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 6. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 20 variables. [2019-09-09 05:45:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:18,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:18,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:18,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:18,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:18,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:45:18,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 17 [2019-09-09 05:45:19,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:19,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:45:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:45:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:19,081 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 11 states. [2019-09-09 05:45:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:19,404 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-09-09 05:45:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:45:19,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-09-09 05:45:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:19,407 INFO L225 Difference]: With dead ends: 128 [2019-09-09 05:45:19,407 INFO L226 Difference]: Without dead ends: 128 [2019-09-09 05:45:19,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-09-09 05:45:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-09 05:45:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 103. [2019-09-09 05:45:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-09 05:45:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2019-09-09 05:45:19,421 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 42 [2019-09-09 05:45:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:19,422 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2019-09-09 05:45:19,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:45:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2019-09-09 05:45:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:45:19,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:19,426 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2019-09-09 05:45:19,426 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 609767972, now seen corresponding path program 2 times [2019-09-09 05:45:19,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:19,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:19,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:45:19,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:19,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:45:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:45:19,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:45:19,755 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand 14 states. [2019-09-09 05:45:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:20,062 INFO L93 Difference]: Finished difference Result 147 states and 197 transitions. [2019-09-09 05:45:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:45:20,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-09-09 05:45:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:20,065 INFO L225 Difference]: With dead ends: 147 [2019-09-09 05:45:20,065 INFO L226 Difference]: Without dead ends: 147 [2019-09-09 05:45:20,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-09 05:45:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2019-09-09 05:45:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-09 05:45:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2019-09-09 05:45:20,079 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 42 [2019-09-09 05:45:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:20,080 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2019-09-09 05:45:20,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:45:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2019-09-09 05:45:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:45:20,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:20,082 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2019-09-09 05:45:20,082 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:20,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2133199976, now seen corresponding path program 1 times [2019-09-09 05:45:20,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:45:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:20,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:20,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:20,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2019-09-09 05:45:20,204 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [50], [54], [60], [62], [63], [111], [113], [115], [117], [138], [141], [143], [149], [152], [160], [188], [189], [190], [192], [193], [194], [195], [196], [197], [198], [204] [2019-09-09 05:45:20,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:20,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:20,209 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:20,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:20,295 INFO L272 AbstractInterpreter]: Visited 33 different actions 233 times. Merged at 10 different actions 69 times. Never widened. Performed 502 root evaluator evaluations with a maximum evaluation depth of 6. Performed 502 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 2 different actions. Largest state had 19 variables. [2019-09-09 05:45:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:20,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:20,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:20,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:20,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:20,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:20,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:20,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:20,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:21,235 WARN L188 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:22,115 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:22,984 WARN L188 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:23,889 WARN L188 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:24,789 WARN L188 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:25,686 WARN L188 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-09 05:45:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:25,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:25,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2019-09-09 05:45:25,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:25,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:25,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:45:25,717 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand 8 states. [2019-09-09 05:45:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:25,835 INFO L93 Difference]: Finished difference Result 174 states and 230 transitions. [2019-09-09 05:45:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:25,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-09-09 05:45:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:25,837 INFO L225 Difference]: With dead ends: 174 [2019-09-09 05:45:25,841 INFO L226 Difference]: Without dead ends: 174 [2019-09-09 05:45:25,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-09 05:45:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2019-09-09 05:45:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-09 05:45:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2019-09-09 05:45:25,864 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 42 [2019-09-09 05:45:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:25,864 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2019-09-09 05:45:25,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2019-09-09 05:45:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:45:25,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:25,866 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2019-09-09 05:45:25,866 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2104509018, now seen corresponding path program 1 times [2019-09-09 05:45:25,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:45:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:45:25,935 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:45:25,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:25 BoogieIcfgContainer [2019-09-09 05:45:25,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:25,974 INFO L168 Benchmark]: Toolchain (without parser) took 14134.58 ms. Allocated memory was 133.7 MB in the beginning and 300.4 MB in the end (delta: 166.7 MB). Free memory was 89.2 MB in the beginning and 189.3 MB in the end (delta: -100.1 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,975 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.33 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 89.0 MB in the beginning and 175.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,977 INFO L168 Benchmark]: Boogie Preprocessor took 75.44 ms. Allocated memory is still 201.3 MB. Free memory was 175.3 MB in the beginning and 173.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,978 INFO L168 Benchmark]: RCFGBuilder took 511.76 ms. Allocated memory is still 201.3 MB. Free memory was 173.5 MB in the beginning and 150.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,979 INFO L168 Benchmark]: TraceAbstraction took 12992.77 ms. Allocated memory was 201.3 MB in the beginning and 300.4 MB in the end (delta: 99.1 MB). Free memory was 149.9 MB in the beginning and 189.3 MB in the end (delta: -39.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:25,983 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.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 550.33 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 89.0 MB in the beginning and 175.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.44 ms. Allocated memory is still 201.3 MB. Free memory was 175.3 MB in the beginning and 173.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 511.76 ms. Allocated memory is still 201.3 MB. Free memory was 173.5 MB in the beginning and 150.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12992.77 ms. Allocated memory was 201.3 MB in the beginning and 300.4 MB in the end (delta: 99.1 MB). Free memory was 149.9 MB in the beginning and 189.3 MB in the end (delta: -39.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 99. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add1 ; [L224] unsigned int r_add2 ; [L225] unsigned int zero ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int __retres14 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L232] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L16] unsigned int res ; [L17] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L20] COND TRUE ! m [L21] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L71] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L232] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L232] zero = base2flt(0, 0) [L233] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L16] unsigned int res ; [L17] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L20] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L26] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L48] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L50] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L71] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L233] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L233] a = base2flt(ma, ea) [L234] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L16] unsigned int res ; [L17] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L20] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L26] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L48] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L50] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L67] m = m & ~ (1U << 24U) [L68] res = m | (unsigned int )((e + 128) << 24U) [L69] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=1, e=0, res=1] [L71] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=4294967297, __retres4=1, e=0, res=1] [L234] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967297, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L234] b = base2flt(mb, eb) [L235] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=1] [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L85] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] eb = (int )(b >> 24U) - 128 [L104] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, eb=128] [L105] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 1 error locations. UNSAFE Result, 12.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 534 SDtfs, 255 SDslu, 3932 SDs, 0 SdLazy, 882 SolverSat, 40 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 282 SyntacticMatches, 7 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 111 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 575 ConstructedInterpolants, 16 QuantifiedInterpolants, 60686 SizeOfPredicates, 17 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 196/250 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...