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/nla-digbench/egcd2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:17:54,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:17:54,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:17:54,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:17:54,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:17:54,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:17:54,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:17:54,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:17:54,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:17:54,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:17:54,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:17:54,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:17:54,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:17:54,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:17:54,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:17:54,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:17:54,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:17:54,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:17:54,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:17:54,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:17:54,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:17:54,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:17:54,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:17:54,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:17:54,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:17:54,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:17:54,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:17:54,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:17:54,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:17:54,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:17:54,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:17:54,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:17:54,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:17:54,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:17:54,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:17:54,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:17:54,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:17:54,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:17:54,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:17:54,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:17:54,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:17:54,705 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-05 13:17:54,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:17:54,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:17:54,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:17:54,724 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:17:54,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:17:54,725 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:17:54,725 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:17:54,725 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:17:54,725 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:17:54,725 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:17:54,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:17:54,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:17:54,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:17:54,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:17:54,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:17:54,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:17:54,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:17:54,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:17:54,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:17:54,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:17:54,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:17:54,729 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:17:54,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:17:54,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:17:54,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:17:54,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:17:54,730 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:17:54,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:17:54,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:17:54,731 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:17:54,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:17:54,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:17:54,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:17:54,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:17:54,801 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:17:54,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-05 13:17:54,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2768bf0/de29ab1aa3904a5bb820246b1549d64c/FLAG0aeb96dbf [2019-09-05 13:17:55,260 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:17:55,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-05 13:17:55,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2768bf0/de29ab1aa3904a5bb820246b1549d64c/FLAG0aeb96dbf [2019-09-05 13:17:55,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2768bf0/de29ab1aa3904a5bb820246b1549d64c [2019-09-05 13:17:55,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:17:55,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:17:55,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:17:55,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:17:55,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:17:55,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:17:55" (1/1) ... [2019-09-05 13:17:55,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17114e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:55, skipping insertion in model container [2019-09-05 13:17:55,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:17:55" (1/1) ... [2019-09-05 13:17:55,705 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:17:55,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:17:55,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:17:55,940 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:17:55,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:17:56,070 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:17:56,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56 WrapperNode [2019-09-05 13:17:56,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:17:56,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:17:56,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:17:56,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:17:56,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (1/1) ... [2019-09-05 13:17:56,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:17:56,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:17:56,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:17:56,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:17:56,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (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-05 13:17:56,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:17:56,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:17:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:17:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:17:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:17:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:17:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:17:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:17:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:17:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:17:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:17:56,376 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:17:56,377 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 13:17:56,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:17:56 BoogieIcfgContainer [2019-09-05 13:17:56,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:17:56,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:17:56,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:17:56,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:17:56,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:17:55" (1/3) ... [2019-09-05 13:17:56,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b1d316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:17:56, skipping insertion in model container [2019-09-05 13:17:56,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:56" (2/3) ... [2019-09-05 13:17:56,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b1d316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:17:56, skipping insertion in model container [2019-09-05 13:17:56,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:17:56" (3/3) ... [2019-09-05 13:17:56,408 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd2.c [2019-09-05 13:17:56,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:17:56,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:17:56,469 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:17:56,492 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:17:56,492 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:17:56,493 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:17:56,493 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:17:56,493 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:17:56,493 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:17:56,493 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:17:56,493 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:17:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-05 13:17:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:17:56,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:56,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:56,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -558324168, now seen corresponding path program 1 times [2019-09-05 13:17:56,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:56,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:56,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:17:56,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:56,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:17:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:17:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:17:56,654 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-05 13:17:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:56,669 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-09-05 13:17:56,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:17:56,671 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:17:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:56,679 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:17:56,679 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 13:17:56,681 INFO L628 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-09-05 13:17:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 13:17:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 13:17:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 13:17:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-09-05 13:17:56,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-09-05 13:17:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:56,721 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-09-05 13:17:56,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:17:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-09-05 13:17:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:17:56,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:56,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:56,722 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1008536757, now seen corresponding path program 1 times [2019-09-05 13:17:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:56,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:56,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:56,734 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:56,783 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:17:56,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:56,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:56,784 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-05 13:17:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:56,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 13:17:56,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:56,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-05 13:17:56,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:56,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:17:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:17:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:17:56,876 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2019-09-05 13:17:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:56,901 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2019-09-05 13:17:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:17:56,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-05 13:17:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:56,903 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:17:56,903 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:17:56,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:17:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:17:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-05 13:17:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:17:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-05 13:17:56,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 11 [2019-09-05 13:17:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:56,914 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-05 13:17:56,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:17:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-05 13:17:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:17:56,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:56,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:56,916 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1182801044, now seen corresponding path program 1 times [2019-09-05 13:17:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:56,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:56,926 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:56,926 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:56,926 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:56,951 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:17:56,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:56,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:56,952 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-05 13:17:56,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:56,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:56,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:17:56,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:57,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-05 13:17:57,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:57,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:17:57,086 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2019-09-05 13:17:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:57,159 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-09-05 13:17:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:57,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 13:17:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:57,160 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:17:57,161 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:17:57,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:17:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-09-05 13:17:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 13:17:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-05 13:17:57,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2019-09-05 13:17:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:57,169 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-05 13:17:57,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-05 13:17:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:17:57,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:57,170 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:57,170 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2031293851, now seen corresponding path program 1 times [2019-09-05 13:17:57,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:57,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:57,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:57,179 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:57,180 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:57,180 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-09-05 13:17:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:57,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-05 13:17:57,229 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65] [2019-09-05 13:17:57,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:57,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:57,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:57,493 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-09-05 13:17:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:57,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:57,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:57,496 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:57,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:17:57,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:57,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:57,625 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:57,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:17:57,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:57,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:57,627 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-09-05 13:17:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:57,705 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-09-05 13:17:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:57,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:17:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:57,709 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:17:57,709 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:17:57,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:17:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:17:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-05 13:17:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 13:17:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-09-05 13:17:57,717 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 17 [2019-09-05 13:17:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:57,718 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-09-05 13:17:57,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-09-05 13:17:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:17:57,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:57,719 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:57,719 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash -71864628, now seen corresponding path program 1 times [2019-09-05 13:17:57,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:57,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:57,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:57,727 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:57,728 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:57,728 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:57,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-05 13:17:57,756 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67] [2019-09-05 13:17:57,758 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:57,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:57,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:57,808 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-09-05 13:17:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:57,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:57,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:57,808 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:57,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:57,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:57,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:17:57,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:17:57,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:17:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:17:57,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:57,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:57,952 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 5 states. [2019-09-05 13:17:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:58,022 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-09-05 13:17:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:58,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-05 13:17:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:58,024 INFO L225 Difference]: With dead ends: 47 [2019-09-05 13:17:58,024 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 13:17:58,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:17:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 13:17:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-05 13:17:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 13:17:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-09-05 13:17:58,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 22 [2019-09-05 13:17:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:58,032 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-09-05 13:17:58,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-09-05 13:17:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:17:58,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,034 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,034 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash 954332139, now seen corresponding path program 1 times [2019-09-05 13:17:58,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,042 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:58,042 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:58,043 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,077 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-05 13:17:58,078 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [36], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-09-05 13:17:58,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:58,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:58,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:58,113 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-09-05 13:17:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:58,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:58,113 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:58,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:17:58,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:17:58,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:17:58,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-05 13:17:58,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:58,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:17:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:17:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:17:58,271 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 9 states. [2019-09-05 13:17:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:58,439 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2019-09-05 13:17:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:17:58,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-05 13:17:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:58,441 INFO L225 Difference]: With dead ends: 72 [2019-09-05 13:17:58,442 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 13:17:58,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:17:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 13:17:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 42. [2019-09-05 13:17:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 13:17:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-09-05 13:17:58,455 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 34 [2019-09-05 13:17:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:58,456 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-09-05 13:17:58,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:17:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-09-05 13:17:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 13:17:58,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,457 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,458 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash 286726549, now seen corresponding path program 1 times [2019-09-05 13:17:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,466 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:58,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:58,466 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:58,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2019-09-05 13:17:58,495 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [34], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70], [71] [2019-09-05 13:17:58,500 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:58,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:58,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:58,543 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 8. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-09-05 13:17:58,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:58,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:58,543 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:58,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:17:58,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:17:58,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:17:58,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:58,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-05 13:17:58,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:58,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:17:58,663 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2019-09-05 13:17:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:58,768 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2019-09-05 13:17:58,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:17:58,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-05 13:17:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:58,770 INFO L225 Difference]: With dead ends: 81 [2019-09-05 13:17:58,770 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 13:17:58,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 13:17:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-09-05 13:17:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 13:17:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2019-09-05 13:17:58,800 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 36 [2019-09-05 13:17:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:58,801 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2019-09-05 13:17:58,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2019-09-05 13:17:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:17:58,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,805 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,805 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1803964113, now seen corresponding path program 1 times [2019-09-05 13:17:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,822 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:58,822 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:58,822 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 13:17:58,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2019-09-05 13:17:58,858 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [34], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-09-05 13:17:58,860 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:58,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:58,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:58,879 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-09-05 13:17:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:58,879 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:58,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:17:58,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:17:58,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:17:59,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:59,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-05 13:17:59,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:59,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:17:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:17:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:17:59,033 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand 10 states. [2019-09-05 13:17:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:59,876 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2019-09-05 13:17:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:17:59,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-09-05 13:17:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:59,878 INFO L225 Difference]: With dead ends: 111 [2019-09-05 13:17:59,878 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 13:17:59,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:17:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 13:17:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-09-05 13:17:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 13:17:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-09-05 13:17:59,894 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 42 [2019-09-05 13:17:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:59,894 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-09-05 13:17:59,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:17:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-09-05 13:17:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 13:17:59,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:59,896 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:59,896 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1108781502, now seen corresponding path program 2 times [2019-09-05 13:17:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:59,903 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:59,904 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:59,904 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:59,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:59,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:59,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:59,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:59,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:59,938 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:59,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:17:59,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:17:59,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:17:59,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:17:59,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:17:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 13:18:00,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 13:18:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-05 13:18:00,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:00,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:18:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:18:00,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:18:00,211 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 12 states. [2019-09-05 13:18:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:01,182 INFO L93 Difference]: Finished difference Result 166 states and 245 transitions. [2019-09-05 13:18:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:18:01,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-05 13:18:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:01,186 INFO L225 Difference]: With dead ends: 166 [2019-09-05 13:18:01,186 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 13:18:01,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:18:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 13:18:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2019-09-05 13:18:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 13:18:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2019-09-05 13:18:01,206 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 47 [2019-09-05 13:18:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:01,206 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2019-09-05 13:18:01,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:18:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2019-09-05 13:18:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 13:18:01,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:01,208 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:01,208 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1556128492, now seen corresponding path program 1 times [2019-09-05 13:18:01,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:01,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:01,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:01,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:01,215 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:01,215 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:01,216 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:01,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:01,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2019-09-05 13:18:01,261 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [34], [36], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70], [71] [2019-09-05 13:18:01,267 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:01,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:01,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:01,298 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 8. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-09-05 13:18:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:01,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:01,299 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:01,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:01,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 13:18:01,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 13:18:01,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 13:18:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-05 13:18:01,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:01,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:18:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:18:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:18:01,666 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand 16 states. [2019-09-05 13:18:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:03,162 INFO L93 Difference]: Finished difference Result 278 states and 429 transitions. [2019-09-05 13:18:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:18:03,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-09-05 13:18:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:03,166 INFO L225 Difference]: With dead ends: 278 [2019-09-05 13:18:03,166 INFO L226 Difference]: Without dead ends: 276 [2019-09-05 13:18:03,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:18:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-05 13:18:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2019-09-05 13:18:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-05 13:18:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2019-09-05 13:18:03,191 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 58 [2019-09-05 13:18:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:03,192 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2019-09-05 13:18:03,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:18:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2019-09-05 13:18:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 13:18:03,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:03,194 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:03,194 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 419798924, now seen corresponding path program 3 times [2019-09-05 13:18:03,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:03,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:03,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:03,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:03,201 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:03,201 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:03,201 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:03,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:03,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:03,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:03,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:03,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:03,236 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:18:03,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:18:03,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:18:03,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:03,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:18:03,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-05 13:18:03,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 13:18:03,384 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:18:03,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:18:03,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:03,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:18:03,386 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand 5 states. [2019-09-05 13:18:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:03,446 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2019-09-05 13:18:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:18:03,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-05 13:18:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:03,450 INFO L225 Difference]: With dead ends: 197 [2019-09-05 13:18:03,450 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 13:18:03,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:18:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 13:18:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-09-05 13:18:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-05 13:18:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-09-05 13:18:03,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 72 [2019-09-05 13:18:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:03,484 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-09-05 13:18:03,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-09-05 13:18:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-05 13:18:03,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:03,494 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:03,494 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 135833028, now seen corresponding path program 1 times [2019-09-05 13:18:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:03,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:03,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:03,506 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:03,506 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:03,506 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:03,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:03,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:03,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2019-09-05 13:18:03,552 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [34], [36], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-09-05 13:18:03,555 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:03,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:03,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:03,580 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-09-05 13:18:03,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:03,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:03,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:03,581 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:18:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:03,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:03,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:18:03,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 13:18:03,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 13:18:04,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:04,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-05 13:18:04,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:04,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:18:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:18:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:18:04,127 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 16 states. [2019-09-05 13:18:04,603 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-05 13:18:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:05,119 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2019-09-05 13:18:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:18:05,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-05 13:18:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:05,122 INFO L225 Difference]: With dead ends: 228 [2019-09-05 13:18:05,122 INFO L226 Difference]: Without dead ends: 220 [2019-09-05 13:18:05,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:18:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-05 13:18:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-09-05 13:18:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-05 13:18:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2019-09-05 13:18:05,139 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 91 [2019-09-05 13:18:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:05,139 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2019-09-05 13:18:05,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:18:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2019-09-05 13:18:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-05 13:18:05,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:05,142 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:05,142 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1549930679, now seen corresponding path program 2 times [2019-09-05 13:18:05,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:05,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:05,149 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:05,150 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:05,150 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 13:18:05,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:05,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:05,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:05,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:05,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:05,209 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:05,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:18:05,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:18:05,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:05,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 13:18:05,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 67 proven. 43 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-09-05 13:18:05,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 67 proven. 47 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-05 13:18:08,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:08,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-05 13:18:08,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:08,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:18:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:18:08,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=355, Unknown=1, NotChecked=0, Total=420 [2019-09-05 13:18:08,736 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand 21 states. [2019-09-05 13:18:28,502 WARN L188 SmtUtils]: Spent 10.53 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-05 13:18:54,163 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-05 13:18:58,225 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~s~0 1) (forall ((main_~k~0 Int)) (let ((.cse0 (+ main_~k~0 1))) (or (= (+ (* c_main_~x~0 (+ c_main_~p~0 (- (* c_main_~q~0 .cse0)))) (* (+ c_main_~r~0 (- (* c_main_~s~0 .cse0))) c_main_~y~0)) 0) (not (= c_main_~a~0 (+ 0 (* c_main_~b~0 .cse0))))))) (= (+ c_main_~b~0 (* (- c_main_~q~0) c_main_~x~0)) c_main_~y~0) (<= 1 c_main_~x~0) (forall ((v_subst_2 Int)) (let ((.cse1 (+ v_subst_2 1))) (or (= 0 (+ (* (+ c_main_~q~0 (- (* c_main_~p~0 .cse1))) c_main_~x~0) (* (+ c_main_~s~0 (- (* c_main_~r~0 .cse1))) c_main_~y~0))) (not (= (+ (* c_main_~a~0 .cse1) 0) c_main_~b~0))))) (or (= 0 (+ (* (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))) c_main_~x~0) (* c_main_~y~0 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)))) (not (= c_main_~a~0 (+ 0 (* c_main_~b~0 c_main_~k~0)))))) is different from false [2019-09-05 13:19:09,874 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-05 13:19:34,466 WARN L188 SmtUtils]: Spent 16.38 s on a formula simplification that was a NOOP. DAG size: 88 [2019-09-05 13:19:48,936 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-05 13:20:38,869 WARN L188 SmtUtils]: Spent 14.15 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-05 13:20:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:38,906 INFO L93 Difference]: Finished difference Result 219 states and 303 transitions. [2019-09-05 13:20:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:20:38,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-05 13:20:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:38,908 INFO L225 Difference]: With dead ends: 219 [2019-09-05 13:20:38,909 INFO L226 Difference]: Without dead ends: 214 [2019-09-05 13:20:38,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 101.9s TimeCoverageRelationStatistics Valid=242, Invalid=1074, Unknown=20, NotChecked=70, Total=1406 [2019-09-05 13:20:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-05 13:20:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2019-09-05 13:20:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-05 13:20:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2019-09-05 13:20:38,918 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 105 [2019-09-05 13:20:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:38,918 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2019-09-05 13:20:38,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:20:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2019-09-05 13:20:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 13:20:38,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:38,921 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:38,921 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1211103859, now seen corresponding path program 3 times [2019-09-05 13:20:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:38,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:38,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:38,929 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:20:38,929 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:20:38,930 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 13:20:38,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:38,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:20:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:39,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:39,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:20:39,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:39,011 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:20:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:20:39,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:39,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:20:39,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:39,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 13:20:39,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:39,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 126 proven. 340 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2019-09-05 13:20:39,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:39,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:45,722 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-05 13:20:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:47,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:20:49,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:20:52,215 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse0 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= (mod (+ .cse0 v_main_~c~0_BEFORE_CALL_143) (- 2)) 0)) (= 0 (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse1 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse1 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse2 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse2))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse2)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse0) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse0)))))) (not (= |c___VERIFIER_assert_#in~cond| 1)))) is different from true [2019-09-05 13:21:08,773 WARN L188 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2019-09-05 13:21:08,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:15,513 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-05 13:21:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:21:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:19,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-05 13:21:28,056 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse0 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse0 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse1)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse1)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0)))) .cse2) (or .cse3 .cse2 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse4 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse4 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse5)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse5)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0))))) (or .cse3 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165))) (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse6 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse6 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse7 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse7)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse7)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0))))))) is different from true [2019-09-05 13:21:34,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 162 [2019-09-05 13:21:56,983 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 6596 disjunctions. This might take some time... [2019-09-05 13:21:57,014 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 3 disjunctions. [2019-09-05 13:22:03,381 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_18 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse2 (* v_prenex_24 v_prenex_23))) (or (= (+ (* v_prenex_18 v_prenex_24) (* v_prenex_26 v_prenex_21)) v_prenex_19) (not (let ((.cse1 (+ (* v_prenex_22 v_prenex_21) .cse2))) (= (+ (div (+ .cse1 (* (- 1) v_prenex_20)) (- 2)) v_prenex_20) (* .cse1 2)))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (not (= 0 (let ((.cse3 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_28 (- (* .cse3 v_prenex_29)))) (* (- 2) v_prenex_29)) v_prenex_32) (* v_prenex_33 (+ (* 3 (+ (- (* .cse3 v_prenex_31)) v_prenex_30)) (* (- 2) v_prenex_31))))))) (= (+ (* v_prenex_32 v_prenex_29) (* v_prenex_33 v_prenex_31)) (+ (* v_prenex_22 v_prenex_21) (* v_prenex_24 v_prenex_23))) (= v_prenex_19 (+ (* v_prenex_33 v_prenex_30) (* v_prenex_32 v_prenex_28))))) (not (= 0 (mod (+ (+ (* v_prenex_21 v_prenex_22) .cse2) v_prenex_20) (- 2)))) (= 0 (let ((.cse4 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_18 (- (* .cse4 v_prenex_23)))) (* (- 2) v_prenex_23)) v_prenex_24) (* (+ (* 3 (+ (- (* .cse4 v_prenex_22)) v_prenex_26)) (* (- 2) v_prenex_22)) v_prenex_21)))))))) (or .cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_prenex_6 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_9 v_prenex_8))) (or (not (let ((.cse5 (+ .cse6 (* v_prenex_7 v_prenex_6)))) (= (* 2 .cse5) (+ (div (+ .cse5 (* (- 1) v_prenex_5)) (- 2)) v_prenex_5)))) (not (= 0 (mod (+ (+ (* v_prenex_6 v_prenex_7) .cse6) v_prenex_5) (- 2)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= 0 (let ((.cse7 (+ v_prenex_11 1))) (+ (* (+ (* (+ (- (* v_prenex_15 .cse7)) v_prenex_14) 3) (* (- 2) v_prenex_15)) v_prenex_17) (* v_prenex_16 (+ (* (- 2) v_prenex_13) (* (+ v_prenex_12 (- (* v_prenex_13 .cse7))) 3))))))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_17 v_prenex_14) (* v_prenex_16 v_prenex_12))) (= (+ (* v_prenex_16 v_prenex_13) (* v_prenex_17 v_prenex_15)) (+ (* v_prenex_9 v_prenex_8) (* v_prenex_7 v_prenex_6))))) (= 0 (let ((.cse8 (+ v_prenex_11 1))) (+ (* (+ (* (- 2) v_prenex_8) (* (+ (- (* v_prenex_8 .cse8)) v_prenex_3) 3)) v_prenex_9) (* (+ (* (+ v_prenex_10 (- (* v_prenex_7 .cse8))) 3) (* (- 2) v_prenex_7)) v_prenex_6)))))))))) is different from true [2019-09-05 13:22:07,707 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-09-05 13:22:14,436 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse5 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_18 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse2 (* v_prenex_24 v_prenex_23))) (or (= (+ (* v_prenex_18 v_prenex_24) (* v_prenex_26 v_prenex_21)) v_prenex_19) (not (let ((.cse1 (+ (* v_prenex_22 v_prenex_21) .cse2))) (= (+ (div (+ .cse1 (* (- 1) v_prenex_20)) (- 2)) v_prenex_20) (* .cse1 2)))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (not (= 0 (let ((.cse3 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_28 (- (* .cse3 v_prenex_29)))) (* (- 2) v_prenex_29)) v_prenex_32) (* v_prenex_33 (+ (* 3 (+ (- (* .cse3 v_prenex_31)) v_prenex_30)) (* (- 2) v_prenex_31))))))) (= (+ (* v_prenex_32 v_prenex_29) (* v_prenex_33 v_prenex_31)) (+ (* v_prenex_22 v_prenex_21) (* v_prenex_24 v_prenex_23))) (= v_prenex_19 (+ (* v_prenex_33 v_prenex_30) (* v_prenex_32 v_prenex_28))))) (not (= 0 (mod (+ (+ (* v_prenex_21 v_prenex_22) .cse2) v_prenex_20) (- 2)))) (= 0 (let ((.cse4 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_18 (- (* .cse4 v_prenex_23)))) (* (- 2) v_prenex_23)) v_prenex_24) (* (+ (* 3 (+ (- (* .cse4 v_prenex_22)) v_prenex_26)) (* (- 2) v_prenex_22)) v_prenex_21))))))) .cse5) (or .cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse5 (forall ((v_prenex_6 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse7 (* v_prenex_9 v_prenex_8))) (or (not (let ((.cse6 (+ .cse7 (* v_prenex_7 v_prenex_6)))) (= (* 2 .cse6) (+ (div (+ .cse6 (* (- 1) v_prenex_5)) (- 2)) v_prenex_5)))) (not (= 0 (mod (+ (+ (* v_prenex_6 v_prenex_7) .cse7) v_prenex_5) (- 2)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= 0 (let ((.cse8 (+ v_prenex_11 1))) (+ (* (+ (* (+ (- (* v_prenex_15 .cse8)) v_prenex_14) 3) (* (- 2) v_prenex_15)) v_prenex_17) (* v_prenex_16 (+ (* (- 2) v_prenex_13) (* (+ v_prenex_12 (- (* v_prenex_13 .cse8))) 3))))))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_17 v_prenex_14) (* v_prenex_16 v_prenex_12))) (= (+ (* v_prenex_16 v_prenex_13) (* v_prenex_17 v_prenex_15)) (+ (* v_prenex_9 v_prenex_8) (* v_prenex_7 v_prenex_6))))) (= 0 (let ((.cse9 (+ v_prenex_11 1))) (+ (* (+ (* (- 2) v_prenex_8) (* (+ (- (* v_prenex_8 .cse9)) v_prenex_3) 3)) v_prenex_9) (* (+ (* (+ v_prenex_10 (- (* v_prenex_7 .cse9))) 3) (* (- 2) v_prenex_7)) v_prenex_6)))))))))) is different from true [2019-09-05 13:22:14,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:14,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 121 proven. 242 refuted. 123 times theorem prover too weak. 1209 trivial. 14 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-09-05 13:22:14,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:22:14,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 37 [2019-09-05 13:22:14,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:14,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:22:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:22:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=899, Unknown=21, NotChecked=260, Total=1332 [2019-09-05 13:22:14,957 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand 37 states. [2019-09-05 13:22:15,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_main_~k~0 1)) (.cse4 (- c_main_~c~0))) (let ((.cse3 (+ (* c_main_~p~0 c_main_~x~0) (* c_main_~y~0 c_main_~r~0))) (.cse5 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0)))) (.cse7 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)) (.cse1 (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) .cse4) (- 2)) c_main_~c~0) (* 2 c_main_~b~0)))) (.cse2 (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))) (.cse6 (* (- 2) c_main_~q~0)) (.cse8 (* (- 2) c_main_~s~0)) (.cse10 (+ c_main_~p~0 (- (* c_main_~q~0 .cse12)))) (.cse9 (+ c_main_~r~0 (- (* c_main_~s~0 .cse12))))) (and (or (forall ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (not (= c_main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= 0 (let ((.cse0 (+ c_main_~k~0 1))) (+ (* main_~x~0 (+ (* 3 (+ main_~p~0 (- (* main_~q~0 .cse0)))) (* (- 2) main_~q~0))) (* (+ (* (+ main_~r~0 (- (* main_~s~0 .cse0))) 3) (* (- 2) main_~s~0)) main_~y~0)))))) .cse1 .cse2) (= c_main_~a~0 .cse3) (or (not (= c_main_~b~0 (+ (div .cse4 (- 2)) c_main_~c~0))) (= 0 (+ (* c_main_~x~0 (+ (* .cse5 3) .cse6)) (* (+ (* 3 .cse7) .cse8) c_main_~y~0))) (not (= (mod c_main_~c~0 (- 2)) 0))) (or (not (= 0 (mod c_main_~b~0 (- 2)))) (not (= (+ (div (- c_main_~b~0) (- 2)) c_main_~b~0) c_main_~c~0)) (= (+ (* c_main_~y~0 (+ c_main_~s~0 (* .cse9 (- 2)))) (* c_main_~x~0 (+ (* (- 2) .cse10) c_main_~q~0))) 0)) (or .cse1 (forall ((main_~q~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* c_main_~y~0 main_~s~0) (* main_~q~0 c_main_~x~0)))) (= 0 (let ((.cse11 (+ c_main_~k~0 1))) (+ (* c_main_~x~0 (+ (* 3 (+ c_main_~p~0 (- (* main_~q~0 .cse11)))) (* (- 2) main_~q~0))) (* (+ (* (+ c_main_~r~0 (- (* main_~s~0 .cse11))) 3) (* (- 2) main_~s~0)) c_main_~y~0)))))) .cse2) (= c_main_~b~0 (+ (+ (* c_main_~y~0 (+ c_main_~r~0 c_main_~s~0)) (* c_main_~x~0 (+ c_main_~p~0 c_main_~q~0))) (* .cse3 (- 1)))) (or (= 0 (+ (* (+ (* .cse5 (- 2)) c_main_~q~0) c_main_~x~0) (* c_main_~y~0 (+ (* (- 2) .cse7) c_main_~s~0)))) (not (= c_main_~b~0 (* 2 c_main_~c~0)))) (or .cse1 .cse2 (= 0 (+ (* c_main_~x~0 (+ (* 3 .cse10) .cse6)) (* (+ (* .cse9 3) .cse8) c_main_~y~0)))) (or (= (+ (* c_main_~x~0 .cse10) (* .cse9 c_main_~y~0)) 0) (not (= c_main_~b~0 c_main_~c~0)))))) is different from false [2019-09-05 13:22:17,596 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c___VERIFIER_assert_#in~cond| 1))) (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse6 (not .cse5))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_18 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse2 (* v_prenex_24 v_prenex_23))) (or (= (+ (* v_prenex_18 v_prenex_24) (* v_prenex_26 v_prenex_21)) v_prenex_19) (not (let ((.cse1 (+ (* v_prenex_22 v_prenex_21) .cse2))) (= (+ (div (+ .cse1 (* (- 1) v_prenex_20)) (- 2)) v_prenex_20) (* .cse1 2)))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (not (= 0 (let ((.cse3 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_28 (- (* .cse3 v_prenex_29)))) (* (- 2) v_prenex_29)) v_prenex_32) (* v_prenex_33 (+ (* 3 (+ (- (* .cse3 v_prenex_31)) v_prenex_30)) (* (- 2) v_prenex_31))))))) (= (+ (* v_prenex_32 v_prenex_29) (* v_prenex_33 v_prenex_31)) (+ (* v_prenex_22 v_prenex_21) (* v_prenex_24 v_prenex_23))) (= v_prenex_19 (+ (* v_prenex_33 v_prenex_30) (* v_prenex_32 v_prenex_28))))) (not (= 0 (mod (+ (+ (* v_prenex_21 v_prenex_22) .cse2) v_prenex_20) (- 2)))) (= 0 (let ((.cse4 (+ v_prenex_27 1))) (+ (* (+ (* 3 (+ v_prenex_18 (- (* .cse4 v_prenex_23)))) (* (- 2) v_prenex_23)) v_prenex_24) (* (+ (* 3 (+ (- (* .cse4 v_prenex_22)) v_prenex_26)) (* (- 2) v_prenex_22)) v_prenex_21)))))))) .cse5 .cse0 (or .cse0 .cse6 (forall ((v_prenex_6 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse8 (* v_prenex_9 v_prenex_8))) (or (not (let ((.cse7 (+ .cse8 (* v_prenex_7 v_prenex_6)))) (= (* 2 .cse7) (+ (div (+ .cse7 (* (- 1) v_prenex_5)) (- 2)) v_prenex_5)))) (not (= 0 (mod (+ (+ (* v_prenex_6 v_prenex_7) .cse8) v_prenex_5) (- 2)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= 0 (let ((.cse9 (+ v_prenex_11 1))) (+ (* (+ (* (+ (- (* v_prenex_15 .cse9)) v_prenex_14) 3) (* (- 2) v_prenex_15)) v_prenex_17) (* v_prenex_16 (+ (* (- 2) v_prenex_13) (* (+ v_prenex_12 (- (* v_prenex_13 .cse9))) 3))))))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_17 v_prenex_14) (* v_prenex_16 v_prenex_12))) (= (+ (* v_prenex_16 v_prenex_13) (* v_prenex_17 v_prenex_15)) (+ (* v_prenex_9 v_prenex_8) (* v_prenex_7 v_prenex_6))))) (= 0 (let ((.cse10 (+ v_prenex_11 1))) (+ (* (+ (* (- 2) v_prenex_8) (* (+ (- (* v_prenex_8 .cse10)) v_prenex_3) 3)) v_prenex_9) (* (+ (* (+ v_prenex_10 (- (* v_prenex_7 .cse10))) 3) (* (- 2) v_prenex_7)) v_prenex_6)))))))) (or (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse11 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= (mod (+ .cse11 v_main_~c~0_BEFORE_CALL_143) (- 2)) 0)) (= 0 (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse12 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse12 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse13 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse13))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse13)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse11) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse11)))))) .cse6) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)))) is different from false [2019-09-05 13:22:19,952 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse0 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse0 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse1)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse1)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0)))) .cse2) (or .cse3 .cse2 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse4 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse4 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse5)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse5)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0))))) .cse3 (or .cse3 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~b~0_BEFORE_CALL_127 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (or (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165))) (not (= (+ v_main_~c~0_BEFORE_CALL_144 (div (+ v_main_~b~0_BEFORE_CALL_127 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_127))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (not (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_prenex_2) (* v_main_~x~0_BEFORE_CALL_165 v_prenex_1)) v_main_~b~0_BEFORE_CALL_127)) (= 0 (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (+ v_main_~p~0_BEFORE_CALL_139 (- (* .cse6 v_prenex_1))) 3) (* (- 2) v_prenex_1)) v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 (+ (* (- 2) v_prenex_2) (* (+ v_main_~r~0_BEFORE_CALL_139 (- (* .cse6 v_prenex_2))) 3)))))))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (and (= (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)) v_main_~b~0_BEFORE_CALL_127) (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse7 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* main_~x~0 (+ (* (+ (- (* main_~q~0 .cse7)) main_~p~0) 3) (* (- 2) main_~q~0))) (* (+ (* 3 (+ (- (* main_~s~0 .cse7)) main_~r~0)) (* (- 2) main_~s~0)) main_~y~0))) 0)))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_127 v_main_~c~0_BEFORE_CALL_144) (- 2)) 0))))) (or (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse8 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= (mod (+ .cse8 v_main_~c~0_BEFORE_CALL_143) (- 2)) 0)) (= 0 (let ((.cse9 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse9 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse9 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse10 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse10))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse10)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse8) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse8)))))) .cse2))) is different from true [2019-09-05 13:22:21,812 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 33 [2019-09-05 13:22:29,261 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 141 [2019-09-05 13:22:56,613 WARN L188 SmtUtils]: Spent 24.72 s on a formula simplification. DAG size of input: 243 DAG size of output: 78 [2019-09-05 13:23:23,783 WARN L188 SmtUtils]: Spent 22.23 s on a formula simplification. DAG size of input: 173 DAG size of output: 97 [2019-09-05 13:23:36,681 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 139 [2019-09-05 13:23:44,299 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-05 13:24:04,335 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 108 [2019-09-05 13:24:15,645 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 102 [2019-09-05 13:24:22,364 WARN L188 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-05 13:24:31,383 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-05 13:24:37,829 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-09-05 13:24:48,713 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 89 [2019-09-05 13:24:51,564 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0)))) (.cse2 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)) (.cse0 (- c_main_~c~0))) (and (or (not (= c_main_~b~0 (+ (div .cse0 (- 2)) c_main_~c~0))) (= 0 (+ (* c_main_~x~0 (+ (* .cse1 3) (* (- 2) c_main_~q~0))) (* (+ (* 3 .cse2) (* (- 2) c_main_~s~0)) c_main_~y~0))) (not (= (mod c_main_~c~0 (- 2)) 0))) (or (= 0 (+ (* .cse1 c_main_~x~0) (* c_main_~y~0 .cse2))) (not (= c_main_~c~0 0))) (or (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) .cse0) (- 2)) c_main_~c~0) (* 2 c_main_~b~0))) (forall ((main_~q~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* c_main_~y~0 main_~s~0) (* main_~q~0 c_main_~x~0)))) (= 0 (let ((.cse3 (+ c_main_~k~0 1))) (+ (* c_main_~x~0 (+ (* 3 (+ c_main_~p~0 (- (* main_~q~0 .cse3)))) (* (- 2) main_~q~0))) (* (+ (* (+ c_main_~r~0 (- (* main_~s~0 .cse3))) 3) (* (- 2) main_~s~0)) c_main_~y~0)))))) (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))))) is different from true [2019-09-05 13:25:04,756 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-09-05 13:25:11,887 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-05 13:25:13,388 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-09-05 13:25:16,274 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (- c_main_~c~0))) (and (or (forall ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (not (= c_main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= 0 (let ((.cse0 (+ c_main_~k~0 1))) (+ (* main_~x~0 (+ (* 3 (+ main_~p~0 (- (* main_~q~0 .cse0)))) (* (- 2) main_~q~0))) (* (+ (* (+ main_~r~0 (- (* main_~s~0 .cse0))) 3) (* (- 2) main_~s~0)) main_~y~0)))))) (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) .cse1) (- 2)) c_main_~c~0) (* 2 c_main_~b~0))) (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))) (or (not (= c_main_~b~0 (+ (div .cse1 (- 2)) c_main_~c~0))) (= 0 (+ (* c_main_~x~0 (+ (* (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))) 3) (* (- 2) c_main_~q~0))) (* (+ (* 3 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)) (* (- 2) c_main_~s~0)) c_main_~y~0))) (not (= (mod c_main_~c~0 (- 2)) 0))))) is different from true [2019-09-05 13:25:16,798 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 13:25:25,537 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-09-05 13:25:40,138 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-05 13:25:54,579 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 76 [2019-09-05 13:25:55,255 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 49 [2019-09-05 13:25:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:57,554 INFO L93 Difference]: Finished difference Result 430 states and 616 transitions. [2019-09-05 13:25:57,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 13:25:57,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 174 [2019-09-05 13:25:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:57,559 INFO L225 Difference]: With dead ends: 430 [2019-09-05 13:25:57,560 INFO L226 Difference]: Without dead ends: 427 [2019-09-05 13:25:57,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 315 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 218.3s TimeCoverageRelationStatistics Valid=592, Invalid=3643, Unknown=91, NotChecked=1224, Total=5550 [2019-09-05 13:25:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-05 13:25:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 288. [2019-09-05 13:25:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-05 13:25:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 388 transitions. [2019-09-05 13:25:57,579 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 388 transitions. Word has length 174 [2019-09-05 13:25:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:57,580 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 388 transitions. [2019-09-05 13:25:57,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:25:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 388 transitions. [2019-09-05 13:25:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-05 13:25:57,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:25:57,585 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:25:57,585 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:25:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:25:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash 521722288, now seen corresponding path program 4 times [2019-09-05 13:25:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:25:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:57,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:25:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:57,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:25:57,593 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:25:57,593 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:25:57,593 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:25:57,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:25:57,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:25:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:57,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:25:57,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:25:57,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:57,674 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:25:57,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:25:57,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:25:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:57,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 13:25:57,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:25:58,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:25:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 80 proven. 285 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-05 13:25:58,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:02,454 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-05 13:26:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 80 proven. 285 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-05 13:26:02,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:26:02,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-05 13:26:02,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:02,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:26:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:26:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:26:02,592 INFO L87 Difference]: Start difference. First operand 288 states and 388 transitions. Second operand 36 states. [2019-09-05 13:26:03,748 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-09-05 13:26:06,009 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 215 [2019-09-05 13:26:07,623 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 130 [2019-09-05 13:26:08,631 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-09-05 13:26:11,626 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-05 13:26:17,755 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 179 [2019-09-05 13:26:18,917 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-05 13:26:19,516 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-05 13:26:20,879 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 85 [2019-09-05 13:26:22,799 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-05 13:26:24,494 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-09-05 13:26:35,385 WARN L188 SmtUtils]: Spent 6.30 s on a formula simplification that was a NOOP. DAG size: 182 [2019-09-05 13:26:38,520 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-05 13:26:38,874 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-05 13:26:43,471 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 131 [2019-09-05 13:26:54,124 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-05 13:27:07,321 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 36 [2019-09-05 13:27:14,570 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 186 [2019-09-05 13:27:17,551 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-05 13:27:20,633 WARN L188 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 132 [2019-09-05 13:27:30,090 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 130 [2019-09-05 13:27:31,805 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-05 13:27:42,015 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 144 [2019-09-05 13:27:43,108 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-09-05 13:27:49,157 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 86 [2019-09-05 13:27:53,134 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-05 13:27:55,137 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 96 [2019-09-05 13:27:56,838 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 70 [2019-09-05 13:28:08,886 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 110 [2019-09-05 13:28:14,468 WARN L188 SmtUtils]: Spent 4.72 s on a formula simplification that was a NOOP. DAG size: 96 [2019-09-05 13:28:19,614 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-09-05 13:28:23,876 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 82 [2019-09-05 13:28:25,249 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-05 13:28:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:28:27,288 INFO L93 Difference]: Finished difference Result 766 states and 1177 transitions. [2019-09-05 13:28:27,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 13:28:27,288 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 240 [2019-09-05 13:28:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:28:27,295 INFO L225 Difference]: With dead ends: 766 [2019-09-05 13:28:27,295 INFO L226 Difference]: Without dead ends: 761 [2019-09-05 13:28:27,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2819 ImplicationChecksByTransitivity, 70.7s TimeCoverageRelationStatistics Valid=1816, Invalid=10614, Unknown=2, NotChecked=0, Total=12432 [2019-09-05 13:28:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-09-05 13:28:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 552. [2019-09-05 13:28:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-05 13:28:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 823 transitions. [2019-09-05 13:28:27,332 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 823 transitions. Word has length 240 [2019-09-05 13:28:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:28:27,333 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 823 transitions. [2019-09-05 13:28:27,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:28:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 823 transitions. [2019-09-05 13:28:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-05 13:28:27,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:28:27,341 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:28:27,341 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:28:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:28:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1065853872, now seen corresponding path program 5 times [2019-09-05 13:28:27,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:28:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:28:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:27,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:28:27,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:28:27,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:28:27,350 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:28:27,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:28:27,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:28:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:28:27,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:28:27,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:28:27,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:27,457 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:28:27,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:28:27,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:28:51,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:28:51,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:28:51,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 13:28:51,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:29:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5019 backedges. 622 proven. 134 refuted. 0 times theorem prover too weak. 4263 trivial. 0 not checked. [2019-09-05 13:29:10,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:29:10,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:10,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:10,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:10,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:21,078 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~y~0_BEFORE_CALL_268 Int) (main_~k~0 Int) (v_main_~r~0_BEFORE_CALL_253 Int) (v_main_~s~0_BEFORE_CALL_239 Int) (v_main_~q~0_BEFORE_CALL_247 Int) (v_main_~p~0_BEFORE_CALL_253 Int) (v_main_~x~0_BEFORE_CALL_301 Int)) (or (= (let ((.cse1 (+ main_~k~0 1))) (+ (* (+ v_main_~p~0_BEFORE_CALL_253 (- (* .cse1 v_main_~q~0_BEFORE_CALL_247))) v_main_~x~0_BEFORE_CALL_301) (* (+ v_main_~r~0_BEFORE_CALL_253 (- (* v_main_~s~0_BEFORE_CALL_239 .cse1))) v_main_~y~0_BEFORE_CALL_268))) 0) (exists ((v_prenex_34 Int) (main_~q~0 Int) (main_~s~0 Int)) (let ((.cse2 (+ (* v_main_~y~0_BEFORE_CALL_268 v_main_~s~0_BEFORE_CALL_239) (* v_main_~x~0_BEFORE_CALL_301 v_main_~q~0_BEFORE_CALL_247))) (.cse3 (+ v_prenex_34 1))) (and (= .cse2 (+ (* v_main_~y~0_BEFORE_CALL_268 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_301))) (= (+ 0 (* .cse2 (+ main_~k~0 1))) (+ 0 (* .cse3 .cse2))) (not (= 0 (+ (* v_main_~y~0_BEFORE_CALL_268 (+ (- (* main_~s~0 .cse3)) v_main_~r~0_BEFORE_CALL_253)) (* v_main_~x~0_BEFORE_CALL_301 (+ v_main_~p~0_BEFORE_CALL_253 (- (* main_~q~0 .cse3)))))))))) (not true)))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_268 Int) (main_~k~0 Int) (v_main_~r~0_BEFORE_CALL_253 Int) (v_main_~s~0_BEFORE_CALL_239 Int) (v_main_~q~0_BEFORE_CALL_247 Int) (v_main_~p~0_BEFORE_CALL_253 Int) (v_main_~x~0_BEFORE_CALL_301 Int)) (or (= (let ((.cse4 (+ main_~k~0 1))) (+ (* (+ v_main_~p~0_BEFORE_CALL_253 (- (* .cse4 v_main_~q~0_BEFORE_CALL_247))) v_main_~x~0_BEFORE_CALL_301) (* (+ v_main_~r~0_BEFORE_CALL_253 (- (* v_main_~s~0_BEFORE_CALL_239 .cse4))) v_main_~y~0_BEFORE_CALL_268))) 0) (exists ((v_prenex_34 Int) (main_~q~0 Int) (main_~s~0 Int)) (let ((.cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 v_main_~s~0_BEFORE_CALL_239) (* v_main_~x~0_BEFORE_CALL_301 v_main_~q~0_BEFORE_CALL_247))) (.cse6 (+ v_prenex_34 1))) (and (= .cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_301))) (= (+ 0 (* .cse5 (+ main_~k~0 1))) (+ 0 (* .cse6 .cse5))) (not (= 0 (+ (* v_main_~y~0_BEFORE_CALL_268 (+ (- (* main_~s~0 .cse6)) v_main_~r~0_BEFORE_CALL_253)) (* v_main_~x~0_BEFORE_CALL_301 (+ v_main_~p~0_BEFORE_CALL_253 (- (* main_~q~0 .cse6)))))))))))) .cse0))) is different from true [2019-09-05 13:29:23,119 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-05 13:29:29,522 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (or (exists ((v_prenex_44 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse1 (+ v_prenex_42 1)) (.cse0 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_41)))) (and (= .cse0 (+ (* v_prenex_43 v_prenex_41) (* v_prenex_35 v_prenex_44))) (not (= (+ (* (+ v_prenex_37 (- (* .cse1 v_prenex_44))) v_prenex_35) (* (+ (- (* .cse1 v_prenex_43)) v_prenex_40) v_prenex_41)) 0)) (= (+ 0 (* .cse0 (+ v_prenex_36 1))) (+ 0 (* .cse1 .cse0)))))) (= (let ((.cse2 (+ v_prenex_36 1))) (+ (* v_prenex_41 (+ (- (* v_prenex_39 .cse2)) v_prenex_40)) (* (+ (- (* v_prenex_38 .cse2)) v_prenex_37) v_prenex_35))) 0))) .cse3) (or (forall ((v_main_~y~0_BEFORE_CALL_268 Int) (main_~k~0 Int) (v_main_~r~0_BEFORE_CALL_253 Int) (v_main_~s~0_BEFORE_CALL_239 Int) (v_main_~q~0_BEFORE_CALL_247 Int) (v_main_~p~0_BEFORE_CALL_253 Int) (v_main_~x~0_BEFORE_CALL_301 Int)) (or (= (let ((.cse4 (+ main_~k~0 1))) (+ (* (+ v_main_~p~0_BEFORE_CALL_253 (- (* .cse4 v_main_~q~0_BEFORE_CALL_247))) v_main_~x~0_BEFORE_CALL_301) (* (+ v_main_~r~0_BEFORE_CALL_253 (- (* v_main_~s~0_BEFORE_CALL_239 .cse4))) v_main_~y~0_BEFORE_CALL_268))) 0) (exists ((v_prenex_34 Int) (main_~q~0 Int) (main_~s~0 Int)) (let ((.cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 v_main_~s~0_BEFORE_CALL_239) (* v_main_~x~0_BEFORE_CALL_301 v_main_~q~0_BEFORE_CALL_247))) (.cse6 (+ v_prenex_34 1))) (and (= .cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_301))) (= (+ 0 (* .cse5 (+ main_~k~0 1))) (+ 0 (* .cse6 .cse5))) (not (= 0 (+ (* v_main_~y~0_BEFORE_CALL_268 (+ (- (* main_~s~0 .cse6)) v_main_~r~0_BEFORE_CALL_253)) (* v_main_~x~0_BEFORE_CALL_301 (+ v_main_~p~0_BEFORE_CALL_253 (- (* main_~q~0 .cse6)))))))))))) .cse3))) is different from true [2019-09-05 13:29:33,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-05 13:29:41,349 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-05 13:29:51,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:51,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:29:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5019 backedges. 779 proven. 173 refuted. 14 times theorem prover too weak. 4042 trivial. 11 not checked. [2019-09-05 13:29:51,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:29:51,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2019-09-05 13:29:51,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:29:51,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:29:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:29:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=464, Unknown=15, NotChecked=90, Total=650 [2019-09-05 13:29:51,983 INFO L87 Difference]: Start difference. First operand 552 states and 823 transitions. Second operand 26 states. [2019-09-05 13:30:19,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c___VERIFIER_assert_#in~cond| 1))) (let ((.cse3 (not .cse4))) (and (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (or (exists ((v_prenex_44 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse1 (+ v_prenex_42 1)) (.cse0 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_41)))) (and (= .cse0 (+ (* v_prenex_43 v_prenex_41) (* v_prenex_35 v_prenex_44))) (not (= (+ (* (+ v_prenex_37 (- (* .cse1 v_prenex_44))) v_prenex_35) (* (+ (- (* .cse1 v_prenex_43)) v_prenex_40) v_prenex_41)) 0)) (= (+ 0 (* .cse0 (+ v_prenex_36 1))) (+ 0 (* .cse1 .cse0)))))) (= (let ((.cse2 (+ v_prenex_36 1))) (+ (* v_prenex_41 (+ (- (* v_prenex_39 .cse2)) v_prenex_40)) (* (+ (- (* v_prenex_38 .cse2)) v_prenex_37) v_prenex_35))) 0))) .cse3) .cse4 (or (forall ((v_main_~y~0_BEFORE_CALL_268 Int) (main_~k~0 Int) (v_main_~r~0_BEFORE_CALL_253 Int) (v_main_~s~0_BEFORE_CALL_239 Int) (v_main_~q~0_BEFORE_CALL_247 Int) (v_main_~p~0_BEFORE_CALL_253 Int) (v_main_~x~0_BEFORE_CALL_301 Int)) (or (= (let ((.cse5 (+ main_~k~0 1))) (+ (* (+ v_main_~p~0_BEFORE_CALL_253 (- (* .cse5 v_main_~q~0_BEFORE_CALL_247))) v_main_~x~0_BEFORE_CALL_301) (* (+ v_main_~r~0_BEFORE_CALL_253 (- (* v_main_~s~0_BEFORE_CALL_239 .cse5))) v_main_~y~0_BEFORE_CALL_268))) 0) (exists ((v_prenex_34 Int) (main_~q~0 Int) (main_~s~0 Int)) (let ((.cse6 (+ (* v_main_~y~0_BEFORE_CALL_268 v_main_~s~0_BEFORE_CALL_239) (* v_main_~x~0_BEFORE_CALL_301 v_main_~q~0_BEFORE_CALL_247))) (.cse7 (+ v_prenex_34 1))) (and (= .cse6 (+ (* v_main_~y~0_BEFORE_CALL_268 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_301))) (= (+ 0 (* .cse6 (+ main_~k~0 1))) (+ 0 (* .cse7 .cse6))) (not (= 0 (+ (* v_main_~y~0_BEFORE_CALL_268 (+ (- (* main_~s~0 .cse7)) v_main_~r~0_BEFORE_CALL_253)) (* v_main_~x~0_BEFORE_CALL_301 (+ v_main_~p~0_BEFORE_CALL_253 (- (* main_~q~0 .cse7)))))))))))) .cse3)))) is different from false [2019-09-05 13:30:22,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (or (exists ((v_prenex_44 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse1 (+ v_prenex_42 1)) (.cse0 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_41)))) (and (= .cse0 (+ (* v_prenex_43 v_prenex_41) (* v_prenex_35 v_prenex_44))) (not (= (+ (* (+ v_prenex_37 (- (* .cse1 v_prenex_44))) v_prenex_35) (* (+ (- (* .cse1 v_prenex_43)) v_prenex_40) v_prenex_41)) 0)) (= (+ 0 (* .cse0 (+ v_prenex_36 1))) (+ 0 (* .cse1 .cse0)))))) (= (let ((.cse2 (+ v_prenex_36 1))) (+ (* v_prenex_41 (+ (- (* v_prenex_39 .cse2)) v_prenex_40)) (* (+ (- (* v_prenex_38 .cse2)) v_prenex_37) v_prenex_35))) 0))) .cse3) (or (forall ((v_main_~y~0_BEFORE_CALL_268 Int) (main_~k~0 Int) (v_main_~r~0_BEFORE_CALL_253 Int) (v_main_~s~0_BEFORE_CALL_239 Int) (v_main_~q~0_BEFORE_CALL_247 Int) (v_main_~p~0_BEFORE_CALL_253 Int) (v_main_~x~0_BEFORE_CALL_301 Int)) (or (= (let ((.cse4 (+ main_~k~0 1))) (+ (* (+ v_main_~p~0_BEFORE_CALL_253 (- (* .cse4 v_main_~q~0_BEFORE_CALL_247))) v_main_~x~0_BEFORE_CALL_301) (* (+ v_main_~r~0_BEFORE_CALL_253 (- (* v_main_~s~0_BEFORE_CALL_239 .cse4))) v_main_~y~0_BEFORE_CALL_268))) 0) (exists ((v_prenex_34 Int) (main_~q~0 Int) (main_~s~0 Int)) (let ((.cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 v_main_~s~0_BEFORE_CALL_239) (* v_main_~x~0_BEFORE_CALL_301 v_main_~q~0_BEFORE_CALL_247))) (.cse6 (+ v_prenex_34 1))) (and (= .cse5 (+ (* v_main_~y~0_BEFORE_CALL_268 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_301))) (= (+ 0 (* .cse5 (+ main_~k~0 1))) (+ 0 (* .cse6 .cse5))) (not (= 0 (+ (* v_main_~y~0_BEFORE_CALL_268 (+ (- (* main_~s~0 .cse6)) v_main_~r~0_BEFORE_CALL_253)) (* v_main_~x~0_BEFORE_CALL_301 (+ v_main_~p~0_BEFORE_CALL_253 (- (* main_~q~0 .cse6)))))))))))) .cse3) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-09-05 13:30:53,623 WARN L188 SmtUtils]: Spent 25.37 s on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2019-09-05 13:31:24,185 WARN L188 SmtUtils]: Spent 20.43 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-05 13:31:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:31:57,094 INFO L93 Difference]: Finished difference Result 590 states and 851 transitions. [2019-09-05 13:31:57,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:31:57,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 284 [2019-09-05 13:31:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:31:57,097 INFO L225 Difference]: With dead ends: 590 [2019-09-05 13:31:57,097 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:31:57,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 542 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 120.5s TimeCoverageRelationStatistics Valid=161, Invalid=757, Unknown=28, NotChecked=244, Total=1190 [2019-09-05 13:31:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:31:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:31:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:31:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:31:57,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-09-05 13:31:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:31:57,099 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:31:57,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:31:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:31:57,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:31:57,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:31:57 BoogieIcfgContainer [2019-09-05 13:31:57,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:31:57,114 INFO L168 Benchmark]: Toolchain (without parser) took 841418.30 ms. Allocated memory was 139.5 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 85.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,115 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.04 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 85.3 MB in the beginning and 177.8 MB in the end (delta: -92.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,120 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory is still 199.2 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,122 INFO L168 Benchmark]: RCFGBuilder took 267.42 ms. Allocated memory is still 199.2 MB. Free memory was 175.6 MB in the beginning and 162.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,122 INFO L168 Benchmark]: TraceAbstraction took 840724.97 ms. Allocated memory was 199.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 162.5 MB in the beginning and 1.2 GB in the end (delta: -991.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-05 13:31:57,125 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 381.04 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 85.3 MB in the beginning and 177.8 MB in the end (delta: -92.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory is still 199.2 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 267.42 ms. Allocated memory is still 199.2 MB. Free memory was 175.6 MB in the beginning and 162.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 840724.97 ms. Allocated memory was 199.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 162.5 MB in the beginning and 1.2 GB in the end (delta: -991.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 840.6s OverallTime, 16 OverallIterations, 49 TraceHistogramMax, 647.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 674 SDtfs, 684 SDslu, 4545 SDs, 0 SdLazy, 6893 SolverSat, 1464 SolverUnsat, 191 SolverUnknown, 0 SolverNotchecked, 199.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2669 GetRequests, 2282 SyntacticMatches, 16 SemanticMatches, 371 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 4490 ImplicationChecksByTransitivity, 513.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 485 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 24.4s SatisfiabilityAnalysisTime, 166.6s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2469 ConstructedInterpolants, 101 QuantifiedInterpolants, 3798270 SizeOfPredicates, 129 NumberOfNonLiveVariables, 2469 ConjunctsInSsa, 492 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 21699/23520 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...