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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/nla-digbench/prodbin.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:37,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:37,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:37,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:37,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:37,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:37,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:37,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:37,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:37,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:37,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:37,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:37,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:37,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:37,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:37,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:37,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:37,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:37,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:37,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:37,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:37,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:37,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:37,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:37,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:37,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:37,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:37,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:37,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:37,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:37,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:37,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:37,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:37,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:37,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:37,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:37,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:37,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:37,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:37,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:37,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:37,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:06:37,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:37,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:37,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:37,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:37,718 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:37,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:37,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:37,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:37,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:37,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:37,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:37,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:37,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:37,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:37,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:37,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:37,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:37,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:37,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:37,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:37,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:37,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:37,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:37,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:37,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:37,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:37,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:37,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:37,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:06:38,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:38,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:38,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:38,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:38,025 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:38,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prodbin.c [2019-10-15 01:06:38,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9ad5a7/54dc5f801d11478f8ea58206aa7dc021/FLAG0ed17214c [2019-10-15 01:06:38,602 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:38,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin.c [2019-10-15 01:06:38,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9ad5a7/54dc5f801d11478f8ea58206aa7dc021/FLAG0ed17214c [2019-10-15 01:06:39,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9ad5a7/54dc5f801d11478f8ea58206aa7dc021 [2019-10-15 01:06:39,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:39,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:39,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:39,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:39,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:39,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220166f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39, skipping insertion in model container [2019-10-15 01:06:39,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:39,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:39,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:39,296 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:39,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:39,329 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:39,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39 WrapperNode [2019-10-15 01:06:39,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:39,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:39,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:39,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:39,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (1/1) ... [2019-10-15 01:06:39,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:39,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:39,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:39,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:39,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (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-10-15 01:06:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:06:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-10-15 01:06:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:06:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:06:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:39,717 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:39,718 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:06:39,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:39 BoogieIcfgContainer [2019-10-15 01:06:39,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:39,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:39,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:39,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:39,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:39" (1/3) ... [2019-10-15 01:06:39,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4d6f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:39, skipping insertion in model container [2019-10-15 01:06:39,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:39" (2/3) ... [2019-10-15 01:06:39,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4d6f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:39, skipping insertion in model container [2019-10-15 01:06:39,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:39" (3/3) ... [2019-10-15 01:06:39,736 INFO L109 eAbstractionObserver]: Analyzing ICFG prodbin.c [2019-10-15 01:06:39,749 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:39,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:39,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:39,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:39,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:39,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:39,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:39,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:39,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:39,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:39,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-15 01:06:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 01:06:39,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:39,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:39,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1560104174, now seen corresponding path program 1 times [2019-10-15 01:06:39,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:39,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67170645] [2019-10-15 01:06:39,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:39,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:39,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:39,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67170645] [2019-10-15 01:06:39,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:39,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:06:39,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637614761] [2019-10-15 01:06:39,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:39,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:40,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:40,013 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-10-15 01:06:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:40,036 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-15 01:06:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:40,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-15 01:06:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:40,050 INFO L225 Difference]: With dead ends: 39 [2019-10-15 01:06:40,051 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 01:06:40,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 01:06:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 01:06:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 01:06:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-15 01:06:40,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-10-15 01:06:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:40,100 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-15 01:06:40,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-15 01:06:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 01:06:40,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:40,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:40,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1561891634, now seen corresponding path program 1 times [2019-10-15 01:06:40,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:40,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032903346] [2019-10-15 01:06:40,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:40,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:40,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:40,124 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:40,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43040912] [2019-10-15 01:06:40,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:40,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 01:06:40,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:40,271 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:40,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032903346] [2019-10-15 01:06:40,352 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:40,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43040912] [2019-10-15 01:06:40,352 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:40,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-15 01:06:40,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011866425] [2019-10-15 01:06:40,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:40,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:40,356 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-10-15 01:06:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:40,482 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-15 01:06:40,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:40,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-10-15 01:06:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:40,484 INFO L225 Difference]: With dead ends: 34 [2019-10-15 01:06:40,485 INFO L226 Difference]: Without dead ends: 27 [2019-10-15 01:06:40,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-15 01:06:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-15 01:06:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 01:06:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-15 01:06:40,494 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2019-10-15 01:06:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:40,495 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-15 01:06:40,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-15 01:06:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:06:40,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:40,496 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:40,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:40,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1038075816, now seen corresponding path program 1 times [2019-10-15 01:06:40,702 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:40,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154493845] [2019-10-15 01:06:40,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:40,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:40,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:40,711 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:40,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040113598] [2019-10-15 01:06:40,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:40,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-15 01:06:40,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:40,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:42,984 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:43,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:45,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154493845] [2019-10-15 01:06:45,575 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:45,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040113598] [2019-10-15 01:06:45,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [450406382] [2019-10-15 01:06:45,581 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 20 [2019-10-15 01:06:45,616 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:45,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:45,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:06:45,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:06:45,799 INFO L272 AbstractInterpreter]: Visited 16 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 8. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-10-15 01:06:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:45,804 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:45,804 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:45,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-15 01:06:45,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482610815] [2019-10-15 01:06:45,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:06:45,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:06:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2019-10-15 01:06:45,806 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2019-10-15 01:06:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:48,913 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-15 01:06:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:06:48,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-10-15 01:06:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:48,917 INFO L225 Difference]: With dead ends: 46 [2019-10-15 01:06:48,917 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:06:48,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=65, Invalid=205, Unknown=2, NotChecked=0, Total=272 [2019-10-15 01:06:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:06:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-10-15 01:06:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 01:06:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-15 01:06:48,929 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 19 [2019-10-15 01:06:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:48,929 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-15 01:06:48,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:06:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-15 01:06:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:06:48,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:48,932 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:49,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:49,139 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash 776909625, now seen corresponding path program 1 times [2019-10-15 01:06:49,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:49,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278333497] [2019-10-15 01:06:49,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:49,148 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:49,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126447683] [2019-10-15 01:06:49,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:49,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:06:49,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:06:49,274 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:49,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:49,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:06:49,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278333497] [2019-10-15 01:06:49,355 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:49,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126447683] [2019-10-15 01:06:49,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1086215916] [2019-10-15 01:06:49,356 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 26 [2019-10-15 01:06:49,358 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:49,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:49,381 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:06:49,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:06:49,439 INFO L272 AbstractInterpreter]: Visited 18 different actions 40 times. Merged at 5 different actions 5 times. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 8. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-10-15 01:06:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,440 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:49,440 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:49,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-15 01:06:49,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821072313] [2019-10-15 01:06:49,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:06:49,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:06:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:06:49,445 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 13 states. [2019-10-15 01:06:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:49,655 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-15 01:06:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:06:49,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-15 01:06:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:49,657 INFO L225 Difference]: With dead ends: 47 [2019-10-15 01:06:49,657 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 01:06:49,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 01:06:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-15 01:06:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-15 01:06:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-15 01:06:49,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2019-10-15 01:06:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:49,667 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-15 01:06:49,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:06:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-10-15 01:06:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:06:49,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:49,669 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:49,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:49,873 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -21140942, now seen corresponding path program 1 times [2019-10-15 01:06:49,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:49,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005063831] [2019-10-15 01:06:49,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:49,880 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:49,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992328831] [2019-10-15 01:06:49,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:49,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-15 01:06:49,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:50,201 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-10-15 01:06:50,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:06:50,351 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:50,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:06:50,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:06:50,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:06:50,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005063831] [2019-10-15 01:06:50,914 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:50,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992328831] [2019-10-15 01:06:50,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [349194624] [2019-10-15 01:06:50,914 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 29 [2019-10-15 01:06:50,917 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:50,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:50,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:06:50,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:06:50,964 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 23 root evaluator evaluations with a maximum evaluation depth of 10. Performed 23 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-10-15 01:06:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,964 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:50,964 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:50,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-10-15 01:06:50,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610154576] [2019-10-15 01:06:50,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:06:50,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:06:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:06:50,967 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 19 states. [2019-10-15 01:06:51,292 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-10-15 01:06:52,367 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-10-15 01:06:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,605 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-10-15 01:06:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:06:52,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-10-15 01:06:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,609 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:06:52,609 INFO L226 Difference]: Without dead ends: 70 [2019-10-15 01:06:52,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:06:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-15 01:06:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-15 01:06:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 01:06:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2019-10-15 01:06:52,636 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 28 [2019-10-15 01:06:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,639 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2019-10-15 01:06:52,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:06:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2019-10-15 01:06:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:06:52,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,642 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:52,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:52,847 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1143516456, now seen corresponding path program 1 times [2019-10-15 01:06:52,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196429390] [2019-10-15 01:06:52,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,855 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:52,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841931587] [2019-10-15 01:06:52,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:06:52,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:52,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:06:53,457 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:53,860 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-15 01:06:54,130 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-15 01:06:54,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:07:11,475 WARN L191 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-10-15 01:07:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:07:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:07:18,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196429390] [2019-10-15 01:07:18,858 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:07:18,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841931587] [2019-10-15 01:07:18,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1917862834] [2019-10-15 01:07:18,858 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 38 [2019-10-15 01:07:18,860 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:07:18,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:07:18,877 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:07:18,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:07:18,948 INFO L272 AbstractInterpreter]: Visited 17 different actions 29 times. Merged at 5 different actions 5 times. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 10. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 3 different actions. Largest state had 7 variables. [2019-10-15 01:07:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,948 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:07:18,949 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:07:18,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-10-15 01:07:18,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92006024] [2019-10-15 01:07:18,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:07:18,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:07:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=449, Unknown=2, NotChecked=0, Total=552 [2019-10-15 01:07:18,951 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 24 states. [2019-10-15 01:07:21,547 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-10-15 01:07:22,943 WARN L191 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 34 [2019-10-15 01:07:25,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_main_~y~0 2))) (let ((.cse12 (+ .cse3 1)) (.cse10 (= (mod c_main_~y~0 2) 0))) (let ((.cse15 (not .cse10)) (.cse7 (* c_main_~x~0 4)) (.cse14 (div .cse12 2))) (let ((.cse0 (<= 0 c_main_~y~0)) (.cse2 (* .cse7 .cse14)) (.cse1 (* c_main_~x~0 c_main_~y~0)) (.cse5 (and (< c_main_~y~0 0) .cse15)) (.cse6 (* c_main_~a~0 c_main_~b~0)) (.cse11 (* c_main_~x~0 2))) (and (or .cse0 (= .cse1 .cse2)) (forall ((v_main_~y~0_33 Int)) (or (<= 0 v_main_~y~0_33) (< v_main_~y~0_33 (+ (div c_main_~y~0 2) 1)) (= (* (* c_main_~x~0 2) v_main_~y~0_33) (* (* c_main_~x~0 8) (div (+ (div v_main_~y~0_33 2) 1) 2))))) (let ((.cse4 (mod .cse3 2))) (or (and (<= 0 .cse3) (= 1 .cse4)) .cse5 (let ((.cse9 (= 0 .cse4)) (.cse8 (div .cse3 2))) (and (or (= .cse6 (+ c_main_~z~0 (* .cse7 .cse8))) (not .cse9)) (or .cse9 (= (+ c_main_~z~0 (* .cse7 (+ .cse8 1))) .cse6)))))) (or .cse10 .cse0 (= (+ c_main_~z~0 (* .cse11 .cse12)) .cse6)) (or .cse10 .cse0 (let ((.cse13 (= 0 (mod .cse12 2)))) (and (or .cse13 (= (+ c_main_~z~0 (* .cse7 (+ .cse14 1))) .cse6)) (or (= .cse6 (+ c_main_~z~0 .cse2)) (not .cse13))))) (= (+ .cse1 c_main_~z~0) .cse6) (or .cse5 (= .cse6 (+ c_main_~z~0 (* .cse11 .cse3)))) (or (forall ((v_main_~y~0_33 Int)) (or (<= 0 v_main_~y~0_33) (< v_main_~y~0_33 (div c_main_~y~0 2)) (= (* (* c_main_~x~0 2) v_main_~y~0_33) (* (* c_main_~x~0 8) (div (+ (div v_main_~y~0_33 2) 1) 2))))) .cse15)))))) is different from false [2019-10-15 01:07:25,633 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22