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/egcd3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:17:56,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:17:56,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:17:56,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:17:56,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:17:56,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:17:56,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:17:56,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:17:56,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:17:56,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:17:56,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:17:56,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:17:56,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:17:56,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:17:56,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:17:56,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:17:56,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:17:56,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:17:56,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:17:56,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:17:56,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:17:56,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:17:56,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:17:56,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:17:56,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:17:56,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:17:56,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:17:56,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:17:56,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:17:56,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:17:56,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:17:56,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:17:56,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:17:56,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:17:56,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:17:56,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:17:56,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:17:56,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:17:56,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:17:56,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:17:56,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:17:56,433 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:56,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:17:56,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:17:56,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:17:56,464 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:17:56,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:17:56,465 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:17:56,465 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:17:56,466 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:17:56,466 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:17:56,466 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:17:56,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:17:56,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:17:56,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:17:56,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:17:56,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:17:56,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:17:56,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:17:56,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:17:56,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:17:56,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:17:56,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:17:56,470 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:17:56,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:17:56,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:17:56,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:17:56,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:17:56,471 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:17:56,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:17:56,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:17:56,472 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:17:56,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:17:56,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:17:56,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:17:56,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:17:56,549 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:17:56,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd3.c [2019-09-05 13:17:56,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a8147b0/8f94f774460d4eb1945d494eb4b9127f/FLAGd5d9c62db [2019-09-05 13:17:57,055 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:17:57,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd3.c [2019-09-05 13:17:57,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a8147b0/8f94f774460d4eb1945d494eb4b9127f/FLAGd5d9c62db [2019-09-05 13:17:57,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a8147b0/8f94f774460d4eb1945d494eb4b9127f [2019-09-05 13:17:57,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:17:57,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:17:57,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:17:57,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:17:57,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:17:57,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:17:57" (1/1) ... [2019-09-05 13:17:57,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70464d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:57, skipping insertion in model container [2019-09-05 13:17:57,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:17:57" (1/1) ... [2019-09-05 13:17:57,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:17:57,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:17:57,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:17:57,721 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:17:57,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:17:57,864 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:17:57,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:57 WrapperNode [2019-09-05 13:17:57,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:17:57,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:17:57,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:17:57,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:17:57,875 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:57" (1/1) ... [2019-09-05 13:17:57,876 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:57" (1/1) ... [2019-09-05 13:17:57,881 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:57" (1/1) ... [2019-09-05 13:17:57,882 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:57" (1/1) ... [2019-09-05 13:17:57,886 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:57" (1/1) ... [2019-09-05 13:17:57,892 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:57" (1/1) ... [2019-09-05 13:17:57,893 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:57" (1/1) ... [2019-09-05 13:17:57,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:17:57,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:17:57,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:17:57,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:17:57,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:57" (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:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:17:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:17:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:17:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:17:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:17:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:17:58,170 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:17:58,171 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-05 13:17:58,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:17:58 BoogieIcfgContainer [2019-09-05 13:17:58,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:17:58,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:17:58,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:17:58,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:17:58,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:17:57" (1/3) ... [2019-09-05 13:17:58,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7e8f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:17:58, skipping insertion in model container [2019-09-05 13:17:58,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:17:57" (2/3) ... [2019-09-05 13:17:58,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7e8f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:17:58, skipping insertion in model container [2019-09-05 13:17:58,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:17:58" (3/3) ... [2019-09-05 13:17:58,198 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd3.c [2019-09-05 13:17:58,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:17:58,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:17:58,246 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:17:58,269 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:17:58,270 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:17:58,270 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:17:58,270 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:17:58,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:17:58,270 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:17:58,270 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:17:58,270 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:17:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-05 13:17:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:17:58,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,294 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2133473032, now seen corresponding path program 1 times [2019-09-05 13:17:58,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,405 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:58,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:58,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:17:58,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:58,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:17:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:17:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:17:58,422 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-05 13:17:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:58,437 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-09-05 13:17:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:17:58,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:17:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:58,446 INFO L225 Difference]: With dead ends: 29 [2019-09-05 13:17:58,446 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:17:58,448 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:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:17:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 13:17:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:17:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-05 13:17:58,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 10 [2019-09-05 13:17:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:58,483 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-05 13:17:58,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:17:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-05 13:17:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:17:58,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,484 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1704601660, now seen corresponding path program 1 times [2019-09-05 13:17:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,498 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:58,498 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:58,499 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:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,536 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:17:58,537 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:58,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:58,537 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:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 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,619 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:58,619 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:58,649 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:58,655 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:58,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-05 13:17:58,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:58,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:17:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:17:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:17:58,657 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-09-05 13:17:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:58,701 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-09-05 13:17:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:17:58,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-05 13:17:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:58,703 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:17:58,703 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 13:17:58,704 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:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 13:17:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-09-05 13:17:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 13:17:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-09-05 13:17:58,717 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 11 [2019-09-05 13:17:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:58,718 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-09-05 13:17:58,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:17:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-09-05 13:17:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:17:58,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:58,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:58,720 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:58,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1987085660, now seen corresponding path program 1 times [2019-09-05 13:17:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:58,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:58,739 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:58,739 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:58,739 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:58,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,769 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:17:58,770 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:58,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:58,770 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:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:58,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:58,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:17:58,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:58,854 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:58,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:58,931 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:58,934 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:58,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:17:58,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:58,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:58,935 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2019-09-05 13:17:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:59,001 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-09-05 13:17:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:59,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-05 13:17:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:59,003 INFO L225 Difference]: With dead ends: 40 [2019-09-05 13:17:59,003 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 13:17:59,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 13:17:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 13:17:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:17:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-09-05 13:17:59,012 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 14 [2019-09-05 13:17:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:59,012 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-09-05 13:17:59,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-09-05 13:17:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:17:59,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:59,014 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:59,014 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1574644974, now seen corresponding path program 1 times [2019-09-05 13:17:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:59,023 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:59,024 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:59,024 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:59,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:59,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-05 13:17:59,061 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [30], [58], [65], [68], [70], [76], [77], [78], [88] [2019-09-05 13:17:59,096 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:59,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:59,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:59,314 INFO L272 AbstractInterpreter]: Visited 15 different actions 25 times. Merged at 6 different actions 6 times. Never widened. Performed 101 root evaluator evaluations with a maximum evaluation depth of 7. Performed 101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 13 variables. [2019-09-05 13:17:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:59,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:59,318 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) [2019-09-05 13:17:59,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:59,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:17:59,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:59,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:59,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-05 13:17:59,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:59,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:17:59,426 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 5 states. [2019-09-05 13:17:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:59,586 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2019-09-05 13:17:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:17:59,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 13:17:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:59,589 INFO L225 Difference]: With dead ends: 78 [2019-09-05 13:17:59,589 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 13:17:59,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 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:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 13:17:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2019-09-05 13:17:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 13:17:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-09-05 13:17:59,612 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 16 [2019-09-05 13:17:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:59,614 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-09-05 13:17:59,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-09-05 13:17:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:17:59,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:59,615 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:59,616 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1955242494, now seen corresponding path program 1 times [2019-09-05 13:17:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:59,638 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:59,638 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:59,639 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) [2019-09-05 13:17:59,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:59,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-05 13:17:59,669 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [32], [41], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82] [2019-09-05 13:17:59,674 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:59,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:59,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:59,727 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 7. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 14 variables. [2019-09-05 13:17:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:59,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:59,727 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:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:59,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:17:59,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:59,800 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:59,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:59,858 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:59,862 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:17:59,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:17:59,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:17:59,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:17:59,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:17:59,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:59,863 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 5 states. [2019-09-05 13:17:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:59,919 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2019-09-05 13:17:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:59,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 13:17:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:59,921 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:17:59,921 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:17:59,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 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:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:17:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-05 13:17:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 13:17:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2019-09-05 13:17:59,930 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 19 [2019-09-05 13:17:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:59,931 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-09-05 13:17:59,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:17:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2019-09-05 13:17:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:17:59,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:59,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:59,932 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:59,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash -697444338, now seen corresponding path program 1 times [2019-09-05 13:17:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:59,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:59,944 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:59,945 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:59,945 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) [2019-09-05 13:17:59,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:59,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-05 13:18:00,004 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [30], [32], [41], [58], [65], [68], [70], [76], [77], [78], [80] [2019-09-05 13:18:00,009 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:00,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:00,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:00,062 INFO L272 AbstractInterpreter]: Visited 16 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Performed 115 root evaluator evaluations with a maximum evaluation depth of 6. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-05 13:18:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:00,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:00,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:00,063 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:18:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:18:00,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:18:00,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:18:00,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:00,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-05 13:18:00,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:00,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:18:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:18:00,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:18:00,219 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 10 states. [2019-09-05 13:18:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:00,379 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-09-05 13:18:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:18:00,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-05 13:18:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:00,381 INFO L225 Difference]: With dead ends: 100 [2019-09-05 13:18:00,381 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 13:18:00,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:18:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 13:18:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-09-05 13:18:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 13:18:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2019-09-05 13:18:00,399 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 19 [2019-09-05 13:18:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:00,399 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2019-09-05 13:18:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:18:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2019-09-05 13:18:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:18:00,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:00,401 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:00,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1428232868, now seen corresponding path program 1 times [2019-09-05 13:18:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:00,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:00,416 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:00,416 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:00,416 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:18:00,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-05 13:18:00,447 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [32], [41], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84] [2019-09-05 13:18:00,451 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:00,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:00,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:00,494 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 7. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 14 variables. [2019-09-05 13:18:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:00,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:00,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:00,495 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:18:00,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:18:00,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:00,557 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:18:00,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:00,591 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:18:00,595 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:18:00,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-05 13:18:00,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:00,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:00,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:00,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:18:00,597 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand 5 states. [2019-09-05 13:18:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:00,667 INFO L93 Difference]: Finished difference Result 138 states and 197 transitions. [2019-09-05 13:18:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:18:00,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-05 13:18:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:00,670 INFO L225 Difference]: With dead ends: 138 [2019-09-05 13:18:00,670 INFO L226 Difference]: Without dead ends: 138 [2019-09-05 13:18:00,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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:18:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-05 13:18:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2019-09-05 13:18:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 13:18:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2019-09-05 13:18:00,695 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 24 [2019-09-05 13:18:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:00,695 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2019-09-05 13:18:00,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2019-09-05 13:18:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:18:00,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:00,696 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:00,697 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -369092908, now seen corresponding path program 1 times [2019-09-05 13:18:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:00,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:00,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:00,703 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:00,704 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:00,704 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:00,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-05 13:18:00,740 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [30], [32], [41], [58], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82] [2019-09-05 13:18:00,742 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:00,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:00,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:00,772 INFO L272 AbstractInterpreter]: Visited 20 different actions 39 times. Merged at 7 different actions 7 times. Never widened. Performed 127 root evaluator evaluations with a maximum evaluation depth of 7. Performed 127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-05 13:18:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:00,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:00,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:00,773 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:18:00,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:00,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:00,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:18:00,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:18:00,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:18:00,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:00,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-05 13:18:00,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:00,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:18:00,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:18:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:18:00,970 INFO L87 Difference]: Start difference. First operand 132 states and 191 transitions. Second operand 12 states. [2019-09-05 13:18:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:01,728 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2019-09-05 13:18:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:18:01,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-09-05 13:18:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:01,732 INFO L225 Difference]: With dead ends: 212 [2019-09-05 13:18:01,732 INFO L226 Difference]: Without dead ends: 212 [2019-09-05 13:18:01,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 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,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-05 13:18:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2019-09-05 13:18:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 13:18:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-05 13:18:01,752 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 24 [2019-09-05 13:18:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:01,752 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-05 13:18:01,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:18:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-05 13:18:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:18:01,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:01,754 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:01,754 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:01,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1127690622, now seen corresponding path program 1 times [2019-09-05 13:18:01,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:01,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:01,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:01,762 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:01,763 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:01,763 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) [2019-09-05 13:18:01,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:01,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:01,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2019-09-05 13:18:01,805 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [32], [41], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84], [85], [86] [2019-09-05 13:18:01,807 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:01,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:01,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:01,827 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 7. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 14 variables. [2019-09-05 13:18:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:01,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:01,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:01,828 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:18:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:01,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:01,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:18:01,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:18:01,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:18:01,915 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:18:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:18:01,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:01,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:18:01,920 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 5 states. [2019-09-05 13:18:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:01,973 INFO L93 Difference]: Finished difference Result 328 states and 509 transitions. [2019-09-05 13:18:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:18:01,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-09-05 13:18:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:01,977 INFO L225 Difference]: With dead ends: 328 [2019-09-05 13:18:01,977 INFO L226 Difference]: Without dead ends: 328 [2019-09-05 13:18:01,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 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:18:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-05 13:18:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 284. [2019-09-05 13:18:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-05 13:18:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 441 transitions. [2019-09-05 13:18:02,001 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 441 transitions. Word has length 29 [2019-09-05 13:18:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:02,001 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 441 transitions. [2019-09-05 13:18:02,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 441 transitions. [2019-09-05 13:18:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:18:02,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:02,003 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:02,003 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash -184535106, now seen corresponding path program 2 times [2019-09-05 13:18:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:02,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:02,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:02,009 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:02,009 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:02,010 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:02,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:02,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:02,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:02,048 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:02,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:02,049 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:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:02,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:18:02,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 13:18:02,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:02,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:18:02,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:18:02,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:18:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:18:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:18:02,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:02,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:18:02,165 INFO L87 Difference]: Start difference. First operand 284 states and 441 transitions. Second operand 5 states. [2019-09-05 13:18:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:02,275 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2019-09-05 13:18:02,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:18:02,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-09-05 13:18:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:02,278 INFO L225 Difference]: With dead ends: 193 [2019-09-05 13:18:02,278 INFO L226 Difference]: Without dead ends: 193 [2019-09-05 13:18:02,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-05 13:18:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-09-05 13:18:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-05 13:18:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2019-09-05 13:18:02,291 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 29 [2019-09-05 13:18:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:02,292 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2019-09-05 13:18:02,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2019-09-05 13:18:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 13:18:02,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:02,294 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:02,294 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1508679066, now seen corresponding path program 1 times [2019-09-05 13:18:02,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:02,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:02,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:02,302 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:02,302 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:02,303 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:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:02,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:02,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2019-09-05 13:18:02,330 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [30], [32], [41], [48], [54], [58], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2019-09-05 13:18:02,333 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:02,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:02,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:02,374 INFO L272 AbstractInterpreter]: Visited 25 different actions 61 times. Merged at 8 different actions 8 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 8. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-05 13:18:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:02,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:02,375 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:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:02,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:02,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:18:02,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:18:02,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:18:02,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:02,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-05 13:18:02,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:02,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:18:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:18:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:18:02,786 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand 18 states. [2019-09-05 13:18:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:07,185 INFO L93 Difference]: Finished difference Result 386 states and 589 transitions. [2019-09-05 13:18:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:18:07,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-09-05 13:18:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:07,190 INFO L225 Difference]: With dead ends: 386 [2019-09-05 13:18:07,190 INFO L226 Difference]: Without dead ends: 383 [2019-09-05 13:18:07,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=283, Invalid=1199, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:18:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-05 13:18:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 294. [2019-09-05 13:18:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-05 13:18:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2019-09-05 13:18:07,210 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 41 [2019-09-05 13:18:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:07,210 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2019-09-05 13:18:07,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:18:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2019-09-05 13:18:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 13:18:07,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:07,213 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 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:07,213 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash -659177953, now seen corresponding path program 1 times [2019-09-05 13:18:07,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:07,222 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:07,222 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:07,222 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:07,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:07,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2019-09-05 13:18:07,252 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [32], [41], [50], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84], [85], [86], [87] [2019-09-05 13:18:07,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:07,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:07,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:07,270 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 7. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 14 variables. [2019-09-05 13:18:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:07,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:07,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:07,271 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:07,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:07,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:18:07,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 13:18:07,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-05 13:18:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:18:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-05 13:18:07,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:07,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:18:07,465 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 5 states. [2019-09-05 13:18:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:07,520 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-09-05 13:18:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:18:07,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-05 13:18:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:07,523 INFO L225 Difference]: With dead ends: 298 [2019-09-05 13:18:07,523 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 13:18:07,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:18:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 13:18:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-05 13:18:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-05 13:18:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 435 transitions. [2019-09-05 13:18:07,536 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 435 transitions. Word has length 51 [2019-09-05 13:18:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:07,537 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 435 transitions. [2019-09-05 13:18:07,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 435 transitions. [2019-09-05 13:18:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 13:18:07,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:07,539 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:07,539 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1685131186, now seen corresponding path program 1 times [2019-09-05 13:18:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:07,545 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:07,546 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:07,546 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:07,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:07,575 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2019-09-05 13:18:07,575 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [30], [32], [41], [48], [54], [58], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84], [85], [86], [87] [2019-09-05 13:18:07,578 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:07,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:07,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:07,608 INFO L272 AbstractInterpreter]: Visited 23 different actions 47 times. Merged at 7 different actions 7 times. Never widened. Performed 137 root evaluator evaluations with a maximum evaluation depth of 8. Performed 137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-05 13:18:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:07,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:07,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:07,608 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) [2019-09-05 13:18:07,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:07,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 13:18:07,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:18:07,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:07,699 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:18:07,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-09-05 13:18:07,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:18:07,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:18:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:18:07,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:18:07,700 INFO L87 Difference]: Start difference. First operand 298 states and 435 transitions. Second operand 5 states. [2019-09-05 13:18:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:07,754 INFO L93 Difference]: Finished difference Result 316 states and 446 transitions. [2019-09-05 13:18:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:18:07,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-05 13:18:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:07,757 INFO L225 Difference]: With dead ends: 316 [2019-09-05 13:18:07,757 INFO L226 Difference]: Without dead ends: 316 [2019-09-05 13:18:07,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:18:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-05 13:18:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2019-09-05 13:18:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-05 13:18:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2019-09-05 13:18:07,770 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 54 [2019-09-05 13:18:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:07,771 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2019-09-05 13:18:07,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:18:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2019-09-05 13:18:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 13:18:07,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:07,774 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:07,775 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash 812510334, now seen corresponding path program 2 times [2019-09-05 13:18:07,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:07,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:07,781 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:07,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:07,782 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) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:07,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:07,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:18:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:07,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:07,813 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:07,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:07,814 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:07,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:07,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:18:07,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 13:18:07,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:07,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 13:18:07,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 13:18:08,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:08,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:08,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:08,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:18:08,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:08,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-09-05 13:18:08,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:08,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:18:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:18:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:18:08,411 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand 21 states. [2019-09-05 13:18:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:10,344 INFO L93 Difference]: Finished difference Result 342 states and 492 transitions. [2019-09-05 13:18:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:18:10,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-09-05 13:18:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:10,354 INFO L225 Difference]: With dead ends: 342 [2019-09-05 13:18:10,354 INFO L226 Difference]: Without dead ends: 340 [2019-09-05 13:18:10,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:18:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-05 13:18:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 305. [2019-09-05 13:18:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-05 13:18:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2019-09-05 13:18:10,372 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 54 [2019-09-05 13:18:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:10,372 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2019-09-05 13:18:10,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:18:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2019-09-05 13:18:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 13:18:10,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:10,374 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 2, 2, 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:10,374 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1962864291, now seen corresponding path program 1 times [2019-09-05 13:18:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:10,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:10,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:10,394 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:18:10,395 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:18:10,395 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) [2019-09-05 13:18:10,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:10,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:18:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:10,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-05 13:18:10,438 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [30], [32], [41], [48], [50], [54], [58], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2019-09-05 13:18:10,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:18:10,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:18:10,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:18:10,472 INFO L272 AbstractInterpreter]: Visited 25 different actions 61 times. Merged at 8 different actions 8 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 8. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-05 13:18:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:10,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:18:10,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:10,473 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) [2019-09-05 13:18:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:10,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:10,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 13:18:10,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 13:18:10,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:11,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:11,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:18:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 13:18:16,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:18:16,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-09-05 13:18:16,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:16,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:18:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:18:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=656, Unknown=5, NotChecked=0, Total=756 [2019-09-05 13:18:16,439 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand 28 states. [2019-09-05 13:18:16,732 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-09-05 13:18:18,870 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 110 [2019-09-05 13:18:19,291 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-05 13:18:27,009 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((main_~y~0 Int)) (let ((.cse0 (* c_main_~q~0 c_main_~x~0)) (.cse1 (* main_~y~0 c_main_~s~0))) (or (not (= (div (+ (- .cse0) (- .cse1)) (- 2)) c_main_~a~0)) (not (= 0 (mod (+ .cse0 .cse1) (- 2)))) (= (+ (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~x~0 (+ (* (- 2) c_main_~p~0) c_main_~q~0)))) (* main_~y~0 c_main_~r~0)) (- (* main_~y~0 (+ (* (- 2) c_main_~r~0) c_main_~s~0)))) c_main_~a~0)))) (or (= (+ (- (* c_main_~y~0 c_main_~s~0)) (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~q~0 c_main_~x~0))) (* c_main_~y~0 c_main_~r~0))) c_main_~a~0) (not (= c_main_~b~0 0))) (forall ((main_~y~0 Int)) (let ((.cse4 (* c_main_~q~0 c_main_~x~0)) (.cse5 (* main_~y~0 c_main_~s~0))) (or (= c_main_~c~0 (let ((.cse3 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (let ((.cse2 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse2 c_main_~x~0) (- (* (+ (* .cse2 (- 2)) c_main_~q~0) c_main_~x~0)))) (* main_~y~0 .cse3)) (- (* main_~y~0 (+ (* (- 2) .cse3) c_main_~s~0)))))) (not (= 0 (mod (+ .cse4 .cse5) (- 2)))) (not (= (div (+ (- .cse4) (- .cse5)) (- 2)) c_main_~c~0)))))) is different from true [2019-09-05 13:18:46,697 WARN L188 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-05 13:18:55,774 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2019-09-05 13:18:55,983 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-05 13:18:56,402 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-09-05 13:19:02,478 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~r~0 0) (= c_main_~s~0 1) (= c_main_~p~0 1) (<= 1 c_main_~x~0) (= 0 (+ c_main_~q~0 2)) (= c_main_~y~0 (+ (* 2 c_main_~a~0) c_main_~b~0)) (or (= c_main_~b~0 (+ (+ (* c_main_~y~0 c_main_~s~0) (+ (- (* (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))) c_main_~x~0)) (* c_main_~q~0 c_main_~x~0))) (- (* c_main_~y~0 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))))) (not (= c_main_~c~0 0))) (= c_main_~a~0 c_main_~x~0) (forall ((main_~y~0 Int)) (let ((.cse2 (* c_main_~q~0 c_main_~x~0)) (.cse3 (* main_~y~0 c_main_~s~0))) (or (= c_main_~c~0 (let ((.cse1 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (let ((.cse0 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse0 c_main_~x~0) (- (* (+ (* .cse0 (- 2)) c_main_~q~0) c_main_~x~0)))) (* main_~y~0 .cse1)) (- (* main_~y~0 (+ (* (- 2) .cse1) c_main_~s~0)))))) (not (= 0 (mod (+ .cse2 .cse3) (- 2)))) (not (= (div (+ (- .cse2) (- .cse3)) (- 2)) c_main_~c~0)))))) is different from false [2019-09-05 13:19:08,685 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-05 13:19:31,443 WARN L188 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-05 13:19:59,872 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 125 [2019-09-05 13:20:02,021 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-05 13:20:04,199 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 85 [2019-09-05 13:20:04,450 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-05 13:20:20,888 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 13:20:21,338 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-05 13:20:21,707 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-05 13:20:25,405 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 110 [2019-09-05 13:20:26,003 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2019-09-05 13:20:28,541 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 145 [2019-09-05 13:20:29,547 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-05 13:20:29,856 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-09-05 13:20:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:29,904 INFO L93 Difference]: Finished difference Result 398 states and 560 transitions. [2019-09-05 13:20:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 13:20:29,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2019-09-05 13:20:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:29,909 INFO L225 Difference]: With dead ends: 398 [2019-09-05 13:20:29,909 INFO L226 Difference]: Without dead ends: 394 [2019-09-05 13:20:29,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=663, Invalid=3617, Unknown=18, NotChecked=258, Total=4556 [2019-09-05 13:20:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-05 13:20:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 361. [2019-09-05 13:20:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-05 13:20:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 512 transitions. [2019-09-05 13:20:29,925 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 512 transitions. Word has length 68 [2019-09-05 13:20:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:29,926 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 512 transitions. [2019-09-05 13:20:29,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:20:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 512 transitions. [2019-09-05 13:20:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 13:20:29,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:29,928 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:29,928 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1959775462, now seen corresponding path program 2 times [2019-09-05 13:20:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:20:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:29,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:29,934 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:20:29,934 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:20:29,934 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:20:29,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:29,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:20:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:29,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:29,978 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:29,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:29,978 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:20:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:20:29,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:20:30,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 13:20:30,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:30,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:20:30,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-05 13:20:30,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-05 13:20:30,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:20:30,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-05 13:20:30,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:20:30,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:20:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:20:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:20:30,119 INFO L87 Difference]: Start difference. First operand 361 states and 512 transitions. Second operand 8 states. [2019-09-05 13:20:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:30,550 INFO L93 Difference]: Finished difference Result 457 states and 655 transitions. [2019-09-05 13:20:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:20:30,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-05 13:20:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:30,554 INFO L225 Difference]: With dead ends: 457 [2019-09-05 13:20:30,554 INFO L226 Difference]: Without dead ends: 457 [2019-09-05 13:20:30,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:20:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-05 13:20:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2019-09-05 13:20:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-05 13:20:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2019-09-05 13:20:30,584 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 76 [2019-09-05 13:20:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:30,584 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2019-09-05 13:20:30,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:20:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2019-09-05 13:20:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-05 13:20:30,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:30,587 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:30,587 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2085410328, now seen corresponding path program 2 times [2019-09-05 13:20:30,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:30,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:30,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:30,606 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:20:30,606 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:20:30,606 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 13:20:30,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:30,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:20:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:30,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:30,658 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:30,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:30,659 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:20:30,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:20:30,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:30,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:20:30,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:30,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 13:20:30,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:32,244 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-05 13:20:32,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 68 proven. 5 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-05 13:20:32,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:32,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 56 proven. 17 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-05 13:20:32,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:20:32,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-09-05 13:20:32,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:20:32,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:20:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:20:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:20:32,996 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 22 states. [2019-09-05 13:20:33,446 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-05 13:20:35,322 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-05 13:20:46,111 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 75 [2019-09-05 13:20:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:51,292 INFO L93 Difference]: Finished difference Result 474 states and 664 transitions. [2019-09-05 13:20:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:20:51,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2019-09-05 13:20:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:51,301 INFO L225 Difference]: With dead ends: 474 [2019-09-05 13:20:51,301 INFO L226 Difference]: Without dead ends: 470 [2019-09-05 13:20:51,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=238, Invalid=1090, Unknown=4, NotChecked=0, Total=1332 [2019-09-05 13:20:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-05 13:20:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 397. [2019-09-05 13:20:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-05 13:20:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 550 transitions. [2019-09-05 13:20:51,320 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 550 transitions. Word has length 85 [2019-09-05 13:20:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:51,321 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 550 transitions. [2019-09-05 13:20:51,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:20:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 550 transitions. [2019-09-05 13:20:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-05 13:20:51,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:51,324 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:51,324 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 878206641, now seen corresponding path program 3 times [2019-09-05 13:20:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:51,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:51,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:51,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:20:51,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:20:51,344 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:20:51,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:51,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:20:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:51,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:51,390 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:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:51,391 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:51,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:20:51,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:20:51,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:20:51,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:51,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:20:51,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:51,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 43 proven. 79 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-09-05 13:20:51,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:52,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:52,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:55,028 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-05 13:20:57,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:59,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:05,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) is different from false [2019-09-05 13:21:07,228 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) is different from true [2019-09-05 13:21:13,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_prenex_2 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_prenex_1 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse11 v_prenex_2)))) (.cse2 (+ (- (* .cse11 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse10 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse6 (+ (- (* v_main_~r~0_45 .cse10)) v_main_~r~0_BEFORE_CALL_85)) (.cse9 (+ (- (* main_~q~0 .cse10)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse8 (* v_main_~x~0_BEFORE_CALL_92 .cse9)) (.cse7 (* v_main_~y~0_BEFORE_CALL_89 .cse6))) (let ((.cse5 (+ .cse8 .cse7))) (and (= .cse5 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse5) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse6)))) (+ .cse7 (+ .cse8 (- (* (+ (* (- 2) .cse9) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse5)))))))) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) is different from false [2019-09-05 13:21:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:22,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90)))))))))) is different from false [2019-09-05 13:21:24,505 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90)))))))))) is different from true [2019-09-05 13:21:36,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:45,537 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-05 13:21:45,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:21:55,905 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-05 13:22:06,420 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse13 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse5 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse3 (+ main_~p~0 (- (* main_~q~0 .cse5)))) (.cse4 (+ main_~r~0 (- (* v_main_~r~0_45 .cse5))))) (let ((.cse1 (* main_~y~0 .cse4)) (.cse2 (* main_~x~0 .cse3))) (let ((.cse0 (+ .cse1 .cse2))) (and (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse1 (+ .cse2 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse3)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse4))))) .cse0)) (= .cse0 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse7 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse11 v_prenex_6)))) (.cse9 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse11 v_prenex_5))))) (let ((.cse8 (* .cse9 v_main_~x~0_BEFORE_CALL_94)) (.cse10 (* v_main_~y~0_BEFORE_CALL_91 .cse7))) (let ((.cse6 (+ .cse8 .cse10))) (or (not (= .cse6 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse6 (+ (- (* (+ (* (- 2) .cse7) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse8 (- (* (+ v_prenex_5 (* (- 2) .cse9)) v_main_~x~0_BEFORE_CALL_94))) .cse10))) (not (= .cse6 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse12) (or .cse13 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse19 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse17 (+ main_~p~0 (- (* main_~q~0 .cse19)))) (.cse18 (+ main_~r~0 (- (* v_main_~r~0_45 .cse19))))) (let ((.cse15 (* main_~y~0 .cse18)) (.cse16 (* main_~x~0 .cse17))) (let ((.cse14 (+ .cse15 .cse16))) (and (= .cse14 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse15 (+ .cse16 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse17)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse18))))) .cse14)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse14 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse25 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse21 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_6)))) (.cse23 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_5))))) (let ((.cse22 (* .cse23 v_main_~x~0_BEFORE_CALL_94)) (.cse24 (* v_main_~y~0_BEFORE_CALL_91 .cse21))) (let ((.cse20 (+ .cse22 .cse24))) (or (not (= .cse20 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse20 (+ (- (* (+ (* (- 2) .cse21) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse22 (- (* (+ v_prenex_5 (* (- 2) .cse23)) v_main_~x~0_BEFORE_CALL_94))) .cse24))) (not (= .cse20 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse12) (or .cse13 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (= v_main_~a~0_BEFORE_CALL_17 (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse31 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse29 (+ main_~p~0 (- (* main_~q~0 .cse31)))) (.cse30 (+ main_~r~0 (- (* v_main_~r~0_45 .cse31))))) (let ((.cse27 (* main_~y~0 .cse30)) (.cse28 (* main_~x~0 .cse29))) (let ((.cse26 (+ .cse27 .cse28))) (and (= .cse26 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse27 (+ .cse28 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse29)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse30))))) .cse26)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse26 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse37 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse33 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_6)))) (.cse35 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_5))))) (let ((.cse34 (* .cse35 v_main_~x~0_BEFORE_CALL_94)) (.cse36 (* v_main_~y~0_BEFORE_CALL_91 .cse33))) (let ((.cse32 (+ .cse34 .cse36))) (or (not (= .cse32 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse32 (+ (- (* (+ (* (- 2) .cse33) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse34 (- (* (+ v_prenex_5 (* (- 2) .cse35)) v_main_~x~0_BEFORE_CALL_94))) .cse36))) (not (= .cse32 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))))))))) is different from true [2019-09-05 13:22:14,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-09-05 13:22:14,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 44 [2019-09-05 13:22:23,852 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (or (not (= 0 (mod v_prenex_29 (- 2)))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse6 (+ v_prenex_26 v_prenex_32))) (let ((.cse5 (+ v_prenex_37 (- (* v_prenex_34 .cse6)))) (.cse4 (+ (- (* v_prenex_36 .cse6)) v_prenex_35))) (let ((.cse3 (* v_prenex_38 .cse4)) (.cse2 (* v_prenex_39 .cse5))) (let ((.cse1 (+ .cse3 .cse2))) (and (= .cse1 (+ v_prenex_30 (* (- 1) v_prenex_31))) (= .cse1 (div (- v_prenex_29) (- 2))) (not (= .cse1 (+ (+ .cse2 (+ .cse3 (- (* (+ (* (- 2) .cse4) v_prenex_36) v_prenex_38)))) (- (* (+ v_prenex_34 (* (- 2) .cse5)) v_prenex_39))))) (= v_prenex_28 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_37))))))))) (forall ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse12 (+ v_prenex_26 v_prenex_32))) (let ((.cse8 (+ v_prenex_27 (- (* v_prenex_40 .cse12)))) (.cse10 (+ v_prenex_33 (- (* v_prenex_41 .cse12))))) (let ((.cse9 (* .cse10 v_prenex_24)) (.cse11 (* .cse8 v_prenex_25))) (let ((.cse7 (+ .cse9 .cse11))) (or (not (= (div (- v_prenex_29) (- 2)) .cse7)) (not (= (+ v_prenex_30 (* (- 1) v_prenex_31)) .cse7)) (= (+ (- (* (+ (* .cse8 (- 2)) v_prenex_40) v_prenex_25)) (+ (+ .cse9 (- (* (+ (* .cse10 (- 2)) v_prenex_41) v_prenex_24))) .cse11)) .cse7))))))) (= v_prenex_28 (+ (* v_prenex_27 v_prenex_25) (* v_prenex_33 v_prenex_24)))))) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse16 (+ main_~p~0 (- (* main_~q~0 .cse18)))) (.cse17 (+ main_~r~0 (- (* v_main_~r~0_45 .cse18))))) (let ((.cse14 (* main_~y~0 .cse17)) (.cse15 (* main_~x~0 .cse16))) (let ((.cse13 (+ .cse14 .cse15))) (and (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse14 (+ .cse15 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse16)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse17))))) .cse13)) (= .cse13 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse20 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_6)))) (.cse22 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_5))))) (let ((.cse21 (* .cse22 v_main_~x~0_BEFORE_CALL_94)) (.cse23 (* v_main_~y~0_BEFORE_CALL_91 .cse20))) (let ((.cse19 (+ .cse21 .cse23))) (or (not (= .cse19 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse19 (+ (- (* (+ (* (- 2) .cse20) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse21 (- (* (+ v_prenex_5 (* (- 2) .cse22)) v_main_~x~0_BEFORE_CALL_94))) .cse23))) (not (= .cse19 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_prenex_15 Int) (v_prenex_7 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (not (= 0 (mod v_prenex_8 (- 2)))) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (let ((.cse31 (+ v_prenex_12 v_prenex_14))) (let ((.cse27 (+ (- (* .cse31 v_prenex_23)) v_prenex_13)) (.cse30 (+ (- (* .cse31 v_prenex_22)) v_prenex_15))) (let ((.cse29 (* .cse30 v_prenex_11)) (.cse28 (* .cse27 v_prenex_7))) (let ((.cse26 (+ .cse29 .cse28))) (or (not (= .cse26 (div (- v_prenex_8) (- 2)))) (= (+ (+ (+ (- (* (+ v_prenex_23 (* .cse27 (- 2))) v_prenex_7)) .cse28) .cse29) (- (* (+ (* .cse30 (- 2)) v_prenex_22) v_prenex_11))) .cse26) (not (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse26)))))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse37 (+ v_prenex_12 v_prenex_14))) (let ((.cse34 (+ v_prenex_16 (- (* .cse37 v_prenex_17)))) (.cse36 (+ v_prenex_18 (- (* .cse37 v_prenex_19))))) (let ((.cse33 (* .cse36 v_prenex_21)) (.cse35 (* .cse34 v_prenex_20))) (let ((.cse32 (+ .cse33 .cse35))) (and (= (+ (* v_prenex_18 v_prenex_21) (* v_prenex_16 v_prenex_20)) v_main_~a~0_BEFORE_CALL_17) (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse32) (= (div (- v_prenex_8) (- 2)) .cse32) (not (= (+ (+ .cse33 (+ (- (* (+ v_prenex_17 (* .cse34 (- 2))) v_prenex_20)) .cse35)) (- (* (+ (* .cse36 (- 2)) v_prenex_19) v_prenex_21))) .cse32)))))))))) .cse25))) is different from true [2019-09-05 13:22:30,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-09-05 13:22:30,740 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 68 [2019-09-05 13:22:39,334 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse26 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse13 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (or (not (= 0 (mod v_prenex_29 (- 2)))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse6 (+ v_prenex_26 v_prenex_32))) (let ((.cse5 (+ v_prenex_37 (- (* v_prenex_34 .cse6)))) (.cse4 (+ (- (* v_prenex_36 .cse6)) v_prenex_35))) (let ((.cse3 (* v_prenex_38 .cse4)) (.cse2 (* v_prenex_39 .cse5))) (let ((.cse1 (+ .cse3 .cse2))) (and (= .cse1 (+ v_prenex_30 (* (- 1) v_prenex_31))) (= .cse1 (div (- v_prenex_29) (- 2))) (not (= .cse1 (+ (+ .cse2 (+ .cse3 (- (* (+ (* (- 2) .cse4) v_prenex_36) v_prenex_38)))) (- (* (+ v_prenex_34 (* (- 2) .cse5)) v_prenex_39))))) (= v_prenex_28 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_37))))))))) (forall ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse12 (+ v_prenex_26 v_prenex_32))) (let ((.cse8 (+ v_prenex_27 (- (* v_prenex_40 .cse12)))) (.cse10 (+ v_prenex_33 (- (* v_prenex_41 .cse12))))) (let ((.cse9 (* .cse10 v_prenex_24)) (.cse11 (* .cse8 v_prenex_25))) (let ((.cse7 (+ .cse9 .cse11))) (or (not (= (div (- v_prenex_29) (- 2)) .cse7)) (not (= (+ v_prenex_30 (* (- 1) v_prenex_31)) .cse7)) (= (+ (- (* (+ (* .cse8 (- 2)) v_prenex_40) v_prenex_25)) (+ (+ .cse9 (- (* (+ (* .cse10 (- 2)) v_prenex_41) v_prenex_24))) .cse11)) .cse7))))))) (= v_prenex_28 (+ (* v_prenex_27 v_prenex_25) (* v_prenex_33 v_prenex_24))))) .cse13) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse19 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse17 (+ main_~p~0 (- (* main_~q~0 .cse19)))) (.cse18 (+ main_~r~0 (- (* v_main_~r~0_45 .cse19))))) (let ((.cse15 (* main_~y~0 .cse18)) (.cse16 (* main_~x~0 .cse17))) (let ((.cse14 (+ .cse15 .cse16))) (and (= .cse14 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse15 (+ .cse16 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse17)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse18))))) .cse14)) (= .cse14 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse25 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse21 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_6)))) (.cse23 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_5))))) (let ((.cse22 (* .cse23 v_main_~x~0_BEFORE_CALL_94)) (.cse24 (* v_main_~y~0_BEFORE_CALL_91 .cse21))) (let ((.cse20 (+ .cse22 .cse24))) (or (not (= .cse20 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse20 (+ (- (* (+ (* (- 2) .cse21) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse22 (- (* (+ v_prenex_5 (* (- 2) .cse23)) v_main_~x~0_BEFORE_CALL_94))) .cse24))) (not (= .cse20 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse26 .cse13) (or .cse0 (forall ((v_prenex_15 Int) (v_prenex_7 Int) (v_prenex_12 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_11 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse38 (+ v_prenex_12 v_prenex_14))) (let ((.cse28 (+ (- (* .cse38 v_prenex_23)) v_prenex_13)) (.cse31 (+ (- (* .cse38 v_prenex_22)) v_prenex_15))) (let ((.cse30 (* .cse31 v_prenex_11)) (.cse29 (* .cse28 v_prenex_7))) (let ((.cse27 (+ .cse30 .cse29))) (or (not (= .cse27 (div (- v_prenex_8) (- 2)))) (not (= 0 (mod v_prenex_8 (- 2)))) (= (+ (+ (+ (- (* (+ v_prenex_23 (* .cse28 (- 2))) v_prenex_7)) .cse29) .cse30) (- (* (+ (* .cse31 (- 2)) v_prenex_22) v_prenex_11))) .cse27) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse37 (+ v_prenex_12 v_prenex_14))) (let ((.cse34 (+ v_prenex_16 (- (* .cse37 v_prenex_17)))) (.cse36 (+ v_prenex_18 (- (* .cse37 v_prenex_19))))) (let ((.cse33 (* .cse36 v_prenex_21)) (.cse35 (* .cse34 v_prenex_20))) (let ((.cse32 (+ .cse33 .cse35))) (and (= (+ (* v_prenex_18 v_prenex_21) (* v_prenex_16 v_prenex_20)) v_main_~a~0_BEFORE_CALL_17) (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse32) (= (div (- v_prenex_8) (- 2)) .cse32) (not (= (+ (+ .cse33 (+ (- (* (+ v_prenex_17 (* .cse34 (- 2))) v_prenex_20)) .cse35)) (- (* (+ (* .cse36 (- 2)) v_prenex_19) v_prenex_21))) .cse32)))))))) (not (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse27)))))))) .cse26 .cse13))) is different from true [2019-09-05 13:22:46,399 WARN L860 $PredicateComparison]: unable to prove that (or (= |c___VERIFIER_assert_#in~cond| 0) (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse5 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse3 (+ main_~p~0 (- (* main_~q~0 .cse5)))) (.cse4 (+ main_~r~0 (- (* v_main_~r~0_45 .cse5))))) (let ((.cse1 (* main_~y~0 .cse4)) (.cse2 (* main_~x~0 .cse3))) (let ((.cse0 (+ .cse1 .cse2))) (and (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse1 (+ .cse2 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse3)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse4))))) .cse0)) (= .cse0 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse7 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse11 v_prenex_6)))) (.cse9 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse11 v_prenex_5))))) (let ((.cse8 (* .cse9 v_main_~x~0_BEFORE_CALL_94)) (.cse10 (* v_main_~y~0_BEFORE_CALL_91 .cse7))) (let ((.cse6 (+ .cse8 .cse10))) (or (not (= .cse6 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse6 (+ (- (* (+ (* (- 2) .cse7) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse8 (- (* (+ v_prenex_5 (* (- 2) .cse9)) v_main_~x~0_BEFORE_CALL_94))) .cse10))) (not (= .cse6 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) is different from true [2019-09-05 13:23:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 31 proven. 53 refuted. 80 times theorem prover too weak. 145 trivial. 17 not checked. [2019-09-05 13:23:09,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:23:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2019-09-05 13:23:09,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:23:09,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 13:23:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 13:23:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=875, Unknown=22, NotChecked=390, Total=1406 [2019-09-05 13:23:09,318 INFO L87 Difference]: Start difference. First operand 397 states and 550 transitions. Second operand 38 states. [2019-09-05 13:23:12,900 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (and .cse0 (or (= |c___VERIFIER_assert_#in~cond| 0) (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse4 (+ main_~p~0 (- (* main_~q~0 .cse6)))) (.cse5 (+ main_~r~0 (- (* v_main_~r~0_45 .cse6))))) (let ((.cse2 (* main_~y~0 .cse5)) (.cse3 (* main_~x~0 .cse4))) (let ((.cse1 (+ .cse2 .cse3))) (and (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse2 (+ .cse3 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse4)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse5))))) .cse1)) (= .cse1 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse12 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse8 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse12 v_prenex_6)))) (.cse10 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse12 v_prenex_5))))) (let ((.cse9 (* .cse10 v_main_~x~0_BEFORE_CALL_94)) (.cse11 (* v_main_~y~0_BEFORE_CALL_91 .cse8))) (let ((.cse7 (+ .cse9 .cse11))) (or (not (= .cse7 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse7 (+ (- (* (+ (* (- 2) .cse8) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse9 (- (* (+ v_prenex_5 (* (- 2) .cse10)) v_main_~x~0_BEFORE_CALL_94))) .cse11))) (not (= .cse7 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) (not .cse0)))) is different from false [2019-09-05 13:23:14,921 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse26 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse13 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (or (not (= 0 (mod v_prenex_29 (- 2)))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse6 (+ v_prenex_26 v_prenex_32))) (let ((.cse5 (+ v_prenex_37 (- (* v_prenex_34 .cse6)))) (.cse4 (+ (- (* v_prenex_36 .cse6)) v_prenex_35))) (let ((.cse3 (* v_prenex_38 .cse4)) (.cse2 (* v_prenex_39 .cse5))) (let ((.cse1 (+ .cse3 .cse2))) (and (= .cse1 (+ v_prenex_30 (* (- 1) v_prenex_31))) (= .cse1 (div (- v_prenex_29) (- 2))) (not (= .cse1 (+ (+ .cse2 (+ .cse3 (- (* (+ (* (- 2) .cse4) v_prenex_36) v_prenex_38)))) (- (* (+ v_prenex_34 (* (- 2) .cse5)) v_prenex_39))))) (= v_prenex_28 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_37))))))))) (forall ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse12 (+ v_prenex_26 v_prenex_32))) (let ((.cse8 (+ v_prenex_27 (- (* v_prenex_40 .cse12)))) (.cse10 (+ v_prenex_33 (- (* v_prenex_41 .cse12))))) (let ((.cse9 (* .cse10 v_prenex_24)) (.cse11 (* .cse8 v_prenex_25))) (let ((.cse7 (+ .cse9 .cse11))) (or (not (= (div (- v_prenex_29) (- 2)) .cse7)) (not (= (+ v_prenex_30 (* (- 1) v_prenex_31)) .cse7)) (= (+ (- (* (+ (* .cse8 (- 2)) v_prenex_40) v_prenex_25)) (+ (+ .cse9 (- (* (+ (* .cse10 (- 2)) v_prenex_41) v_prenex_24))) .cse11)) .cse7))))))) (= v_prenex_28 (+ (* v_prenex_27 v_prenex_25) (* v_prenex_33 v_prenex_24))))) .cse13) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse19 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse17 (+ main_~p~0 (- (* main_~q~0 .cse19)))) (.cse18 (+ main_~r~0 (- (* v_main_~r~0_45 .cse19))))) (let ((.cse15 (* main_~y~0 .cse18)) (.cse16 (* main_~x~0 .cse17))) (let ((.cse14 (+ .cse15 .cse16))) (and (= .cse14 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse15 (+ .cse16 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse17)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse18))))) .cse14)) (= .cse14 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse25 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse21 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_6)))) (.cse23 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse25 v_prenex_5))))) (let ((.cse22 (* .cse23 v_main_~x~0_BEFORE_CALL_94)) (.cse24 (* v_main_~y~0_BEFORE_CALL_91 .cse21))) (let ((.cse20 (+ .cse22 .cse24))) (or (not (= .cse20 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse20 (+ (- (* (+ (* (- 2) .cse21) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse22 (- (* (+ v_prenex_5 (* (- 2) .cse23)) v_main_~x~0_BEFORE_CALL_94))) .cse24))) (not (= .cse20 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse26 .cse13) (= 1 c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_prenex_15 Int) (v_prenex_7 Int) (v_prenex_12 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_11 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse38 (+ v_prenex_12 v_prenex_14))) (let ((.cse28 (+ (- (* .cse38 v_prenex_23)) v_prenex_13)) (.cse31 (+ (- (* .cse38 v_prenex_22)) v_prenex_15))) (let ((.cse30 (* .cse31 v_prenex_11)) (.cse29 (* .cse28 v_prenex_7))) (let ((.cse27 (+ .cse30 .cse29))) (or (not (= .cse27 (div (- v_prenex_8) (- 2)))) (not (= 0 (mod v_prenex_8 (- 2)))) (= (+ (+ (+ (- (* (+ v_prenex_23 (* .cse28 (- 2))) v_prenex_7)) .cse29) .cse30) (- (* (+ (* .cse31 (- 2)) v_prenex_22) v_prenex_11))) .cse27) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse37 (+ v_prenex_12 v_prenex_14))) (let ((.cse34 (+ v_prenex_16 (- (* .cse37 v_prenex_17)))) (.cse36 (+ v_prenex_18 (- (* .cse37 v_prenex_19))))) (let ((.cse33 (* .cse36 v_prenex_21)) (.cse35 (* .cse34 v_prenex_20))) (let ((.cse32 (+ .cse33 .cse35))) (and (= (+ (* v_prenex_18 v_prenex_21) (* v_prenex_16 v_prenex_20)) v_main_~a~0_BEFORE_CALL_17) (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse32) (= (div (- v_prenex_8) (- 2)) .cse32) (not (= (+ (+ .cse33 (+ (- (* (+ v_prenex_17 (* .cse34 (- 2))) v_prenex_20)) .cse35)) (- (* (+ (* .cse36 (- 2)) v_prenex_19) v_prenex_21))) .cse32)))))))) (not (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse27)))))))) .cse26 .cse13) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-09-05 13:23:17,138 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (or (not (= 0 (mod v_prenex_29 (- 2)))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse6 (+ v_prenex_26 v_prenex_32))) (let ((.cse5 (+ v_prenex_37 (- (* v_prenex_34 .cse6)))) (.cse4 (+ (- (* v_prenex_36 .cse6)) v_prenex_35))) (let ((.cse3 (* v_prenex_38 .cse4)) (.cse2 (* v_prenex_39 .cse5))) (let ((.cse1 (+ .cse3 .cse2))) (and (= .cse1 (+ v_prenex_30 (* (- 1) v_prenex_31))) (= .cse1 (div (- v_prenex_29) (- 2))) (not (= .cse1 (+ (+ .cse2 (+ .cse3 (- (* (+ (* (- 2) .cse4) v_prenex_36) v_prenex_38)))) (- (* (+ v_prenex_34 (* (- 2) .cse5)) v_prenex_39))))) (= v_prenex_28 (+ (* v_prenex_38 v_prenex_35) (* v_prenex_39 v_prenex_37))))))))) (forall ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse12 (+ v_prenex_26 v_prenex_32))) (let ((.cse8 (+ v_prenex_27 (- (* v_prenex_40 .cse12)))) (.cse10 (+ v_prenex_33 (- (* v_prenex_41 .cse12))))) (let ((.cse9 (* .cse10 v_prenex_24)) (.cse11 (* .cse8 v_prenex_25))) (let ((.cse7 (+ .cse9 .cse11))) (or (not (= (div (- v_prenex_29) (- 2)) .cse7)) (not (= (+ v_prenex_30 (* (- 1) v_prenex_31)) .cse7)) (= (+ (- (* (+ (* .cse8 (- 2)) v_prenex_40) v_prenex_25)) (+ (+ .cse9 (- (* (+ (* .cse10 (- 2)) v_prenex_41) v_prenex_24))) .cse11)) .cse7))))))) (= v_prenex_28 (+ (* v_prenex_27 v_prenex_25) (* v_prenex_33 v_prenex_24)))))) .cse0 (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse16 (+ main_~p~0 (- (* main_~q~0 .cse18)))) (.cse17 (+ main_~r~0 (- (* v_main_~r~0_45 .cse18))))) (let ((.cse14 (* main_~y~0 .cse17)) (.cse15 (* main_~x~0 .cse16))) (let ((.cse13 (+ .cse14 .cse15))) (and (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse14 (+ .cse15 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse16)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse17))))) .cse13)) (= .cse13 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse20 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_6)))) (.cse22 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_5))))) (let ((.cse21 (* .cse22 v_main_~x~0_BEFORE_CALL_94)) (.cse23 (* v_main_~y~0_BEFORE_CALL_91 .cse20))) (let ((.cse19 (+ .cse21 .cse23))) (or (not (= .cse19 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse19 (+ (- (* (+ (* (- 2) .cse20) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse21 (- (* (+ v_prenex_5 (* (- 2) .cse22)) v_main_~x~0_BEFORE_CALL_94))) .cse23))) (not (= .cse19 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_prenex_15 Int) (v_prenex_7 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (not (= 0 (mod v_prenex_8 (- 2)))) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (let ((.cse31 (+ v_prenex_12 v_prenex_14))) (let ((.cse27 (+ (- (* .cse31 v_prenex_23)) v_prenex_13)) (.cse30 (+ (- (* .cse31 v_prenex_22)) v_prenex_15))) (let ((.cse29 (* .cse30 v_prenex_11)) (.cse28 (* .cse27 v_prenex_7))) (let ((.cse26 (+ .cse29 .cse28))) (or (not (= .cse26 (div (- v_prenex_8) (- 2)))) (= (+ (+ (+ (- (* (+ v_prenex_23 (* .cse27 (- 2))) v_prenex_7)) .cse28) .cse29) (- (* (+ (* .cse30 (- 2)) v_prenex_22) v_prenex_11))) .cse26) (not (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse26)))))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse37 (+ v_prenex_12 v_prenex_14))) (let ((.cse34 (+ v_prenex_16 (- (* .cse37 v_prenex_17)))) (.cse36 (+ v_prenex_18 (- (* .cse37 v_prenex_19))))) (let ((.cse33 (* .cse36 v_prenex_21)) (.cse35 (* .cse34 v_prenex_20))) (let ((.cse32 (+ .cse33 .cse35))) (and (= (+ (* v_prenex_18 v_prenex_21) (* v_prenex_16 v_prenex_20)) v_main_~a~0_BEFORE_CALL_17) (= (+ (* (- 1) v_prenex_10) v_prenex_9) .cse32) (= (div (- v_prenex_8) (- 2)) .cse32) (not (= (+ (+ .cse33 (+ (- (* (+ v_prenex_17 (* .cse34 (- 2))) v_prenex_20)) .cse35)) (- (* (+ (* .cse36 (- 2)) v_prenex_19) v_prenex_21))) .cse32)))))))))) .cse25))) is different from true [2019-09-05 13:23:19,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and .cse0 (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse2 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse6 v_prenex_2)))) (.cse3 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse4 (* .cse3 v_main_~x~0_BEFORE_CALL_92)) (.cse5 (* v_main_~y~0_BEFORE_CALL_89 .cse2))) (let ((.cse1 (+ .cse4 .cse5))) (or (not (= .cse1 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse3) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse4) .cse5)) .cse1) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse1)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse8 (+ (- (* v_main_~r~0_45 .cse12)) v_main_~r~0_BEFORE_CALL_85)) (.cse11 (+ (- (* main_~q~0 .cse12)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse10 (* v_main_~x~0_BEFORE_CALL_92 .cse11)) (.cse9 (* v_main_~y~0_BEFORE_CALL_89 .cse8))) (let ((.cse7 (+ .cse10 .cse9))) (and (= .cse7 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse7) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse8)))) (+ .cse9 (+ .cse10 (- (* (+ (* (- 2) .cse11) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse7)))))))))) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse16 (+ main_~p~0 (- (* main_~q~0 .cse18)))) (.cse17 (+ main_~r~0 (- (* v_main_~r~0_45 .cse18))))) (let ((.cse14 (* main_~y~0 .cse17)) (.cse15 (* main_~x~0 .cse16))) (let ((.cse13 (+ .cse14 .cse15))) (and (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse14 (+ .cse15 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse16)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse17))))) .cse13)) (= .cse13 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse20 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_6)))) (.cse22 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_5))))) (let ((.cse21 (* .cse22 v_main_~x~0_BEFORE_CALL_94)) (.cse23 (* v_main_~y~0_BEFORE_CALL_91 .cse20))) (let ((.cse19 (+ .cse21 .cse23))) (or (not (= .cse19 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse19 (+ (- (* (+ (* (- 2) .cse20) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse21 (- (* (+ v_prenex_5 (* (- 2) .cse22)) v_main_~x~0_BEFORE_CALL_94))) .cse23))) (not (= .cse19 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse31 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse29 (+ main_~p~0 (- (* main_~q~0 .cse31)))) (.cse30 (+ main_~r~0 (- (* v_main_~r~0_45 .cse31))))) (let ((.cse27 (* main_~y~0 .cse30)) (.cse28 (* main_~x~0 .cse29))) (let ((.cse26 (+ .cse27 .cse28))) (and (= .cse26 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse27 (+ .cse28 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse29)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse30))))) .cse26)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse26 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse37 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse33 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_6)))) (.cse35 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_5))))) (let ((.cse34 (* .cse35 v_main_~x~0_BEFORE_CALL_94)) (.cse36 (* v_main_~y~0_BEFORE_CALL_91 .cse33))) (let ((.cse32 (+ .cse34 .cse36))) (or (not (= .cse32 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse32 (+ (- (* (+ (* (- 2) .cse33) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse34 (- (* (+ v_prenex_5 (* (- 2) .cse35)) v_main_~x~0_BEFORE_CALL_94))) .cse36))) (not (= .cse32 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (= v_main_~a~0_BEFORE_CALL_17 (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse43 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse41 (+ main_~p~0 (- (* main_~q~0 .cse43)))) (.cse42 (+ main_~r~0 (- (* v_main_~r~0_45 .cse43))))) (let ((.cse39 (* main_~y~0 .cse42)) (.cse40 (* main_~x~0 .cse41))) (let ((.cse38 (+ .cse39 .cse40))) (and (= .cse38 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse39 (+ .cse40 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse41)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse42))))) .cse38)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse38 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse49 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse45 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_6)))) (.cse47 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_5))))) (let ((.cse46 (* .cse47 v_main_~x~0_BEFORE_CALL_94)) (.cse48 (* v_main_~y~0_BEFORE_CALL_91 .cse45))) (let ((.cse44 (+ .cse46 .cse48))) (or (not (= .cse44 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse44 (+ (- (* (+ (* (- 2) .cse45) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse46 (- (* (+ v_prenex_5 (* (- 2) .cse47)) v_main_~x~0_BEFORE_CALL_94))) .cse48))) (not (= .cse44 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))))))))) is different from false [2019-09-05 13:23:21,366 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and .cse0 (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse2 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse6 v_prenex_2)))) (.cse3 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse4 (* .cse3 v_main_~x~0_BEFORE_CALL_92)) (.cse5 (* v_main_~y~0_BEFORE_CALL_89 .cse2))) (let ((.cse1 (+ .cse4 .cse5))) (or (not (= .cse1 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse3) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse4) .cse5)) .cse1) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse1)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse8 (+ (- (* v_main_~r~0_45 .cse12)) v_main_~r~0_BEFORE_CALL_85)) (.cse11 (+ (- (* main_~q~0 .cse12)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse10 (* v_main_~x~0_BEFORE_CALL_92 .cse11)) (.cse9 (* v_main_~y~0_BEFORE_CALL_89 .cse8))) (let ((.cse7 (+ .cse10 .cse9))) (and (= .cse7 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse7) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse8)))) (+ .cse9 (+ .cse10 (- (* (+ (* (- 2) .cse11) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse7)))))))))) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse16 (+ main_~p~0 (- (* main_~q~0 .cse18)))) (.cse17 (+ main_~r~0 (- (* v_main_~r~0_45 .cse18))))) (let ((.cse14 (* main_~y~0 .cse17)) (.cse15 (* main_~x~0 .cse16))) (let ((.cse13 (+ .cse14 .cse15))) (and (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse14 (+ .cse15 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse16)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse17))))) .cse13)) (= .cse13 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse20 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_6)))) (.cse22 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_5))))) (let ((.cse21 (* .cse22 v_main_~x~0_BEFORE_CALL_94)) (.cse23 (* v_main_~y~0_BEFORE_CALL_91 .cse20))) (let ((.cse19 (+ .cse21 .cse23))) (or (not (= .cse19 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse19 (+ (- (* (+ (* (- 2) .cse20) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse21 (- (* (+ v_prenex_5 (* (- 2) .cse22)) v_main_~x~0_BEFORE_CALL_94))) .cse23))) (not (= .cse19 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse31 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse29 (+ main_~p~0 (- (* main_~q~0 .cse31)))) (.cse30 (+ main_~r~0 (- (* v_main_~r~0_45 .cse31))))) (let ((.cse27 (* main_~y~0 .cse30)) (.cse28 (* main_~x~0 .cse29))) (let ((.cse26 (+ .cse27 .cse28))) (and (= .cse26 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse27 (+ .cse28 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse29)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse30))))) .cse26)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse26 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse37 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse33 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_6)))) (.cse35 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_5))))) (let ((.cse34 (* .cse35 v_main_~x~0_BEFORE_CALL_94)) (.cse36 (* v_main_~y~0_BEFORE_CALL_91 .cse33))) (let ((.cse32 (+ .cse34 .cse36))) (or (not (= .cse32 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse32 (+ (- (* (+ (* (- 2) .cse33) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse34 (- (* (+ v_prenex_5 (* (- 2) .cse35)) v_main_~x~0_BEFORE_CALL_94))) .cse36))) (not (= .cse32 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (= v_main_~a~0_BEFORE_CALL_17 (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse43 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse41 (+ main_~p~0 (- (* main_~q~0 .cse43)))) (.cse42 (+ main_~r~0 (- (* v_main_~r~0_45 .cse43))))) (let ((.cse39 (* main_~y~0 .cse42)) (.cse40 (* main_~x~0 .cse41))) (let ((.cse38 (+ .cse39 .cse40))) (and (= .cse38 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse39 (+ .cse40 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse41)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse42))))) .cse38)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse38 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse49 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse45 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_6)))) (.cse47 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_5))))) (let ((.cse46 (* .cse47 v_main_~x~0_BEFORE_CALL_94)) (.cse48 (* v_main_~y~0_BEFORE_CALL_91 .cse45))) (let ((.cse44 (+ .cse46 .cse48))) (or (not (= .cse44 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse44 (+ (- (* (+ (* (- 2) .cse45) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse46 (- (* (+ v_prenex_5 (* (- 2) .cse47)) v_main_~x~0_BEFORE_CALL_94))) .cse48))) (not (= .cse44 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))))))))) is different from true [2019-09-05 13:23:23,425 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| 1) (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90))))))))))) is different from false [2019-09-05 13:23:25,444 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90)))))))))) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-05 13:23:27,449 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90))))))))))) is different from false [2019-09-05 13:23:29,484 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse23 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse20 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse23 main_~q~0)))) (.cse22 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse23))))) (let ((.cse19 (* v_main_~y~0_BEFORE_CALL_90 .cse22)) (.cse21 (* v_main_~x~0_BEFORE_CALL_93 .cse20))) (let ((.cse12 (+ .cse19 .cse21))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse12)) (not (= .cse12 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse17 (+ (- (* .cse18 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse14 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse18 v_prenex_4))))) (let ((.cse15 (* v_main_~y~0_BEFORE_CALL_90 .cse14)) (.cse16 (* .cse17 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse13 (+ .cse15 .cse16))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse13) (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse14) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse15 (+ .cse16 (- (* (+ (* .cse17 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse13)))))))) (= .cse12 (+ (+ .cse19 (+ (- (* (+ (* (- 2) .cse20) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse21)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse22)) v_main_~y~0_BEFORE_CALL_90))))))))))) is different from false [2019-09-05 13:23:31,491 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse23 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse20 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse23 main_~q~0)))) (.cse22 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse23))))) (let ((.cse19 (* v_main_~y~0_BEFORE_CALL_90 .cse22)) (.cse21 (* v_main_~x~0_BEFORE_CALL_93 .cse20))) (let ((.cse12 (+ .cse19 .cse21))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse12)) (not (= .cse12 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse17 (+ (- (* .cse18 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse14 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse18 v_prenex_4))))) (let ((.cse15 (* v_main_~y~0_BEFORE_CALL_90 .cse14)) (.cse16 (* .cse17 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse13 (+ .cse15 .cse16))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse13) (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse14) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse15 (+ .cse16 (- (* (+ (* .cse17 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse13)))))))) (= .cse12 (+ (+ .cse19 (+ (- (* (+ (* (- 2) .cse20) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse21)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse22)) v_main_~y~0_BEFORE_CALL_90))))))))))) is different from true [2019-09-05 13:23:33,601 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (not (= 0 c___VERIFIER_assert_~cond)) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-05 13:23:35,606 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (not (= 0 c___VERIFIER_assert_~cond)) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from true [2019-09-05 13:23:37,719 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| 1) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_2)))) (.cse2 (+ (- (* .cse5 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse3 (* .cse2 v_main_~x~0_BEFORE_CALL_92)) (.cse4 (* v_main_~y~0_BEFORE_CALL_89 .cse1))) (let ((.cse0 (+ .cse3 .cse4))) (or (not (= .cse0 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse1) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse2) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse3) .cse4)) .cse0) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse0)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse7 (+ (- (* v_main_~r~0_45 .cse11)) v_main_~r~0_BEFORE_CALL_85)) (.cse10 (+ (- (* main_~q~0 .cse11)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse9 (* v_main_~x~0_BEFORE_CALL_92 .cse10)) (.cse8 (* v_main_~y~0_BEFORE_CALL_89 .cse7))) (let ((.cse6 (+ .cse9 .cse8))) (and (= .cse6 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse6) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse7)))) (+ .cse8 (+ .cse9 (- (* (+ (* (- 2) .cse10) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse6)))))))))) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-05 13:23:40,425 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-05 13:24:26,688 WARN L188 SmtUtils]: Spent 29.56 s on a formula simplification. DAG size of input: 275 DAG size of output: 94 [2019-09-05 13:25:23,005 WARN L188 SmtUtils]: Spent 24.65 s on a formula simplification. DAG size of input: 278 DAG size of output: 100 [2019-09-05 13:25:25,020 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and .cse0 (not (= 0 c___VERIFIER_assert_~cond)) (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_main_~x~0_BEFORE_CALL_92 Int) (v_main_~c~0_BEFORE_CALL_91 Int) (v_main_~v~0_BEFORE_CALL_93 Int) (v_main_~r~0_BEFORE_CALL_85 Int) (v_main_~d~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_85 Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse2 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse6 v_prenex_2)))) (.cse3 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse4 (* .cse3 v_main_~x~0_BEFORE_CALL_92)) (.cse5 (* v_main_~y~0_BEFORE_CALL_89 .cse2))) (let ((.cse1 (+ .cse4 .cse5))) (or (not (= .cse1 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))) (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse3) v_prenex_1) v_main_~x~0_BEFORE_CALL_92)) .cse4) .cse5)) .cse1) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse1)))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (exists ((main_~q~0 Int) (v_main_~r~0_45 Int)) (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse8 (+ (- (* v_main_~r~0_45 .cse12)) v_main_~r~0_BEFORE_CALL_85)) (.cse11 (+ (- (* main_~q~0 .cse12)) v_main_~p~0_BEFORE_CALL_85))) (let ((.cse10 (* v_main_~x~0_BEFORE_CALL_92 .cse11)) (.cse9 (* v_main_~y~0_BEFORE_CALL_89 .cse8))) (let ((.cse7 (+ .cse10 .cse9))) (and (= .cse7 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93))) (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse7) (not (= (+ (- (* v_main_~y~0_BEFORE_CALL_89 (+ v_main_~r~0_45 (* (- 2) .cse8)))) (+ .cse9 (+ .cse10 (- (* (+ (* (- 2) .cse11) main_~q~0) v_main_~x~0_BEFORE_CALL_92))))) .cse7)))))))))) (or (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse18 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse16 (+ main_~p~0 (- (* main_~q~0 .cse18)))) (.cse17 (+ main_~r~0 (- (* v_main_~r~0_45 .cse18))))) (let ((.cse14 (* main_~y~0 .cse17)) (.cse15 (* main_~x~0 .cse16))) (let ((.cse13 (+ .cse14 .cse15))) (and (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (= (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (+ (+ .cse14 (+ .cse15 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse16)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse17))))) .cse13)) (= .cse13 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse20 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_6)))) (.cse22 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse24 v_prenex_5))))) (let ((.cse21 (* .cse22 v_main_~x~0_BEFORE_CALL_94)) (.cse23 (* v_main_~y~0_BEFORE_CALL_91 .cse20))) (let ((.cse19 (+ .cse21 .cse23))) (or (not (= .cse19 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse19 (+ (- (* (+ (* (- 2) .cse20) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse21 (- (* (+ v_prenex_5 (* (- 2) .cse22)) v_main_~x~0_BEFORE_CALL_94))) .cse23))) (not (= .cse19 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse31 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse29 (+ main_~p~0 (- (* main_~q~0 .cse31)))) (.cse30 (+ main_~r~0 (- (* v_main_~r~0_45 .cse31))))) (let ((.cse27 (* main_~y~0 .cse30)) (.cse28 (* main_~x~0 .cse29))) (let ((.cse26 (+ .cse27 .cse28))) (and (= .cse26 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse27 (+ .cse28 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse29)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse30))))) .cse26)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse26 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse37 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse33 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_6)))) (.cse35 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse37 v_prenex_5))))) (let ((.cse34 (* .cse35 v_main_~x~0_BEFORE_CALL_94)) (.cse36 (* v_main_~y~0_BEFORE_CALL_91 .cse33))) (let ((.cse32 (+ .cse34 .cse36))) (or (not (= .cse32 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse32 (+ (- (* (+ (* (- 2) .cse33) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse34 (- (* (+ v_prenex_5 (* (- 2) .cse35)) v_main_~x~0_BEFORE_CALL_94))) .cse36))) (not (= .cse32 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95)))))))))))) .cse25) (or .cse0 (forall ((v_main_~d~0_BEFORE_CALL_86 Int) (v_main_~a~0_BEFORE_CALL_17 Int) (v_main_~x~0_BEFORE_CALL_94 Int) (v_main_~b~0_BEFORE_CALL_120 Int) (v_main_~c~0_BEFORE_CALL_93 Int) (v_main_~p~0_BEFORE_CALL_87 Int) (v_main_~v~0_BEFORE_CALL_95 Int) (v_main_~k~0_BEFORE_CALL_85 Int) (v_main_~r~0_BEFORE_CALL_87 Int) (v_main_~y~0_BEFORE_CALL_91 Int)) (or (= v_main_~a~0_BEFORE_CALL_17 (+ (* v_main_~r~0_BEFORE_CALL_87 v_main_~y~0_BEFORE_CALL_91) (* v_main_~p~0_BEFORE_CALL_87 v_main_~x~0_BEFORE_CALL_94))) (exists ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (v_main_~r~0_45 Int)) (let ((.cse43 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse41 (+ main_~p~0 (- (* main_~q~0 .cse43)))) (.cse42 (+ main_~r~0 (- (* v_main_~r~0_45 .cse43))))) (let ((.cse39 (* main_~y~0 .cse42)) (.cse40 (* main_~x~0 .cse41))) (let ((.cse38 (+ .cse39 .cse40))) (and (= .cse38 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2))) (not (= (+ (+ .cse39 (+ .cse40 (- (* main_~x~0 (+ main_~q~0 (* (- 2) .cse41)))))) (- (* main_~y~0 (+ v_main_~r~0_45 (* (- 2) .cse42))))) .cse38)) (= v_main_~a~0_BEFORE_CALL_17 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= .cse38 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_120 (- 2)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse49 (+ v_main_~d~0_BEFORE_CALL_86 v_main_~k~0_BEFORE_CALL_85))) (let ((.cse45 (+ v_main_~r~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_6)))) (.cse47 (+ v_main_~p~0_BEFORE_CALL_87 (- (* .cse49 v_prenex_5))))) (let ((.cse46 (* .cse47 v_main_~x~0_BEFORE_CALL_94)) (.cse48 (* v_main_~y~0_BEFORE_CALL_91 .cse45))) (let ((.cse44 (+ .cse46 .cse48))) (or (not (= .cse44 (div (- v_main_~b~0_BEFORE_CALL_120) (- 2)))) (= .cse44 (+ (- (* (+ (* (- 2) .cse45) v_prenex_6) v_main_~y~0_BEFORE_CALL_91)) (+ (+ .cse46 (- (* (+ v_prenex_5 (* (- 2) .cse47)) v_main_~x~0_BEFORE_CALL_94))) .cse48))) (not (= .cse44 (+ v_main_~c~0_BEFORE_CALL_93 (* (- 1) v_main_~v~0_BEFORE_CALL_95))))))))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-09-05 13:25:30,292 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-05 13:25:32,244 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-09-05 13:25:43,253 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-05 13:26:00,854 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~d~0_BEFORE_CALL_85 Int) (v_main_~x~0_BEFORE_CALL_93 Int) (v_main_~b~0_BEFORE_CALL_119 Int) (v_main_~c~0_BEFORE_CALL_92 Int) (v_main_~r~0_BEFORE_CALL_86 Int) (main_~q~0 Int) (v_main_~k~0_BEFORE_CALL_84 Int) (v_main_~v~0_BEFORE_CALL_94 Int) (v_main_~y~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int) (v_main_~p~0_BEFORE_CALL_86 Int)) (let ((.cse11 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_86 (- (* .cse11 main_~q~0)))) (.cse10 (+ v_main_~r~0_BEFORE_CALL_86 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse7 (* v_main_~y~0_BEFORE_CALL_90 .cse10)) (.cse9 (* v_main_~x~0_BEFORE_CALL_93 .cse8))) (let ((.cse0 (+ .cse7 .cse9))) (or (not (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse0)) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2)))) (not (= (mod v_main_~b~0_BEFORE_CALL_119 (- 2)) 0)) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse6 (+ v_main_~d~0_BEFORE_CALL_85 v_main_~k~0_BEFORE_CALL_84))) (let ((.cse5 (+ (- (* .cse6 v_prenex_3)) v_main_~p~0_BEFORE_CALL_86)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_86 (- (* .cse6 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_90 .cse2)) (.cse4 (* .cse5 v_main_~x~0_BEFORE_CALL_93))) (let ((.cse1 (+ .cse3 .cse4))) (and (= (+ v_main_~c~0_BEFORE_CALL_92 (* (- 1) v_main_~v~0_BEFORE_CALL_94)) .cse1) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_119) (- 2))) (not (= (+ (- (* (+ (* (- 2) .cse2) v_prenex_4) v_main_~y~0_BEFORE_CALL_90)) (+ .cse3 (+ .cse4 (- (* (+ (* .cse5 (- 2)) v_prenex_3) v_main_~x~0_BEFORE_CALL_93))))) .cse1)))))))) (= .cse0 (+ (+ .cse7 (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_93)) .cse9)) (- (* (+ v_main_~r~0_45 (* (- 2) .cse10)) v_main_~y~0_BEFORE_CALL_90)))))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-05 13:26:10,601 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 114 [2019-09-05 13:26:19,554 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 99 [2019-09-05 13:26:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:35,268 INFO L93 Difference]: Finished difference Result 784 states and 1111 transitions. [2019-09-05 13:26:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:26:35,270 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 93 [2019-09-05 13:26:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:35,275 INFO L225 Difference]: With dead ends: 784 [2019-09-05 13:26:35,275 INFO L226 Difference]: Without dead ends: 780 [2019-09-05 13:26:35,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 182.4s TimeCoverageRelationStatistics Valid=376, Invalid=2610, Unknown=56, NotChecked=2214, Total=5256 [2019-09-05 13:26:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-09-05 13:26:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 659. [2019-09-05 13:26:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-05 13:26:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 923 transitions. [2019-09-05 13:26:35,302 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 923 transitions. Word has length 93 [2019-09-05 13:26:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:35,302 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 923 transitions. [2019-09-05 13:26:35,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 13:26:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 923 transitions. [2019-09-05 13:26:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-05 13:26:35,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:35,305 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:35,305 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1115368890, now seen corresponding path program 4 times [2019-09-05 13:26:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:35,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:35,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:35,311 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:26:35,311 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:26:35,311 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 13:26:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:35,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:26:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:35,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:35,362 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:26:35,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:35,362 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:26:35,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:35,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:35,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 13:26:35,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 31 proven. 102 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-05 13:26:35,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:36,386 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-05 13:26:36,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:38,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:38,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:49,929 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~y~0 Int)) (let ((.cse3 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse0 (div (+ (* (- 1) .cse3) c_main_~c~0) (- 2)))) (or (not (= (mod .cse0 2) 0)) (= c_main_~c~0 (let ((.cse1 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (* main_~y~0 .cse1) (let ((.cse2 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse2 c_main_~x~0) (- (* (+ c_main_~q~0 (* .cse2 (- 5))) c_main_~x~0))))) (- (* (+ c_main_~s~0 (* (- 5) .cse1)) main_~y~0))))) (not (= (mod (+ .cse3 c_main_~c~0) (- 2)) 0)) (not (= c_main_~c~0 (div .cse0 2))))))) is different from true [2019-09-05 13:27:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 31 proven. 95 refuted. 0 times theorem prover too weak. 435 trivial. 7 not checked. [2019-09-05 13:27:06,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:27:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-09-05 13:27:06,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:27:06,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 13:27:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 13:27:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=914, Unknown=12, NotChecked=62, Total=1122 [2019-09-05 13:27:06,835 INFO L87 Difference]: Start difference. First operand 659 states and 923 transitions. Second operand 34 states. [2019-09-05 13:27:35,193 WARN L188 SmtUtils]: Spent 10.10 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-05 13:28:11,791 WARN L188 SmtUtils]: Spent 18.26 s on a formula simplification. DAG size of input: 100 DAG size of output: 34 [2019-09-05 13:28:32,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~y~0 c_main_~s~0)) (.cse4 (* c_main_~q~0 c_main_~x~0))) (and (= c_main_~s~0 1) (forall ((main_~y~0 Int)) (let ((.cse0 (+ (* c_main_~p~0 c_main_~x~0) (* main_~y~0 c_main_~r~0)))) (let ((.cse1 (div (+ (* (- 1) .cse0) c_main_~b~0) (- 2)))) (or (not (= 0 (mod (+ .cse0 c_main_~b~0) (- 2)))) (not (= c_main_~b~0 (div .cse1 2))) (= c_main_~b~0 (+ (+ (* main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* c_main_~x~0 (+ c_main_~p~0 (* (- 5) c_main_~q~0)))))) (- (* (+ c_main_~r~0 (* (- 5) c_main_~s~0)) main_~y~0)))) (not (= (mod .cse1 2) 0)))))) (= c_main_~p~0 1) (or (not (= c_main_~c~0 c_main_~b~0)) (= c_main_~b~0 (let ((.cse2 (+ c_main_~k~0 1))) (+ (- (* (+ c_main_~r~0 (- (* c_main_~s~0 .cse2))) c_main_~y~0)) (+ .cse3 (+ .cse4 (- (* c_main_~x~0 (+ c_main_~p~0 (- (* c_main_~q~0 .cse2))))))))))) (or (= (+ (- .cse3) (+ (+ (* c_main_~p~0 c_main_~x~0) (- .cse4)) (* c_main_~y~0 c_main_~r~0))) c_main_~a~0) (not (= c_main_~b~0 0))) (forall ((main_~y~0 Int)) (let ((.cse6 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse5 (div (+ (* (- 1) .cse6) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse5 2))) (not (= (mod .cse5 2) 0)) (not (= 0 (mod (+ .cse6 c_main_~a~0) (- 2)))) (= (+ (- (* main_~y~0 (+ (* (- 5) c_main_~r~0) c_main_~s~0))) (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~x~0 (+ (* (- 5) c_main_~p~0) c_main_~q~0)))) (* main_~y~0 c_main_~r~0))) c_main_~a~0))))) (= c_main_~c~0 c_main_~x~0) (forall ((main_~y~0 Int)) (let ((.cse10 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse7 (div (+ (* (- 1) .cse10) c_main_~c~0) (- 2)))) (or (not (= (mod .cse7 2) 0)) (= c_main_~c~0 (let ((.cse8 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (* main_~y~0 .cse8) (let ((.cse9 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse9 c_main_~x~0) (- (* (+ c_main_~q~0 (* .cse9 (- 5))) c_main_~x~0))))) (- (* (+ c_main_~s~0 (* (- 5) .cse8)) main_~y~0))))) (not (= (mod (+ .cse10 c_main_~c~0) (- 2)) 0)) (not (= c_main_~c~0 (div .cse7 2))))))) (= c_main_~r~0 0) (= c_main_~k~0 0) (<= 1 c_main_~x~0) (let ((.cse12 (div (+ c_main_~b~0 (- c_main_~c~0)) (- 2)))) (or (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2)))) (forall ((main_~y~0 Int)) (or (not (= c_main_~a~0 (+ (* c_main_~p~0 c_main_~x~0) (* main_~y~0 c_main_~r~0)))) (= (let ((.cse11 (+ c_main_~k~0 5))) (+ (+ (* main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* c_main_~x~0 (+ c_main_~p~0 (- (* .cse11 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse11 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse12 2))) (not (= 0 (mod .cse12 2))))) (= c_main_~q~0 0) (= c_main_~a~0 c_main_~x~0))) is different from false [2019-09-05 13:28:34,728 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-05 13:28:38,909 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~y~0 c_main_~s~0)) (.cse2 (* c_main_~q~0 c_main_~x~0))) (and (= c_main_~r~0 0) (= c_main_~s~0 1) (= c_main_~p~0 1) (or (not (= c_main_~c~0 c_main_~b~0)) (= c_main_~b~0 (let ((.cse0 (+ c_main_~k~0 1))) (+ (- (* (+ c_main_~r~0 (- (* c_main_~s~0 .cse0))) c_main_~y~0)) (+ .cse1 (+ .cse2 (- (* c_main_~x~0 (+ c_main_~p~0 (- (* c_main_~q~0 .cse0))))))))))) (or (= (+ (- .cse1) (+ (+ (* c_main_~p~0 c_main_~x~0) (- .cse2)) (* c_main_~y~0 c_main_~r~0))) c_main_~a~0) (not (= c_main_~b~0 0))) (forall ((main_~y~0 Int)) (let ((.cse4 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse3 (div (+ (* (- 1) .cse4) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse3 2))) (not (= (mod .cse3 2) 0)) (not (= 0 (mod (+ .cse4 c_main_~a~0) (- 2)))) (= (+ (- (* main_~y~0 (+ (* (- 5) c_main_~r~0) c_main_~s~0))) (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~x~0 (+ (* (- 5) c_main_~p~0) c_main_~q~0)))) (* main_~y~0 c_main_~r~0))) c_main_~a~0))))) (= c_main_~k~0 0) (<= 1 c_main_~x~0) (= c_main_~c~0 c_main_~x~0) (= c_main_~q~0 0) (= c_main_~a~0 c_main_~x~0))) is different from false [2019-09-05 13:28:43,306 WARN L188 SmtUtils]: Spent 3.19 s on a formula simplification that was a NOOP. DAG size: 208 [2019-09-05 13:28:50,471 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-05 13:29:18,688 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 91 [2019-09-05 13:29:49,947 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 168 [2019-09-05 13:29:53,331 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 169 [2019-09-05 13:30:02,333 WARN L188 SmtUtils]: Spent 2.79 s on a formula simplification that was a NOOP. DAG size: 189 [2019-09-05 13:30:04,603 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-05 13:30:05,667 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-09-05 13:30:13,142 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 167 [2019-09-05 13:30:13,902 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2019-09-05 13:30:14,177 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-05 13:30:21,688 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 76 [2019-09-05 13:30:24,028 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 129 [2019-09-05 13:30:29,978 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-09-05 13:30:32,242 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-05 13:30:34,606 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 174 [2019-09-05 13:30:37,715 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (* 5 c_main_~p~0) c_main_~q~0) 0) (= c_main_~r~0 0) (= c_main_~s~0 1) (= c_main_~p~0 1) (forall ((main_~y~0 Int)) (let ((.cse1 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse0 (div (+ (* (- 1) .cse1) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse0 2))) (not (= (mod .cse0 2) 0)) (not (= 0 (mod (+ .cse1 c_main_~a~0) (- 2)))) (= (+ (- (* main_~y~0 (+ (* (- 5) c_main_~r~0) c_main_~s~0))) (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~x~0 (+ (* (- 5) c_main_~p~0) c_main_~q~0)))) (* main_~y~0 c_main_~r~0))) c_main_~a~0))))) (<= 1 c_main_~x~0) (= c_main_~y~0 (+ (* 5 c_main_~x~0) c_main_~b~0)) (= c_main_~a~0 c_main_~x~0)) is different from false [2019-09-05 13:30:56,612 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-05 13:31:02,563 WARN L188 SmtUtils]: Spent 4.18 s on a formula simplification that was a NOOP. DAG size: 159 [2019-09-05 13:31:09,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~y~0 Int)) (let ((.cse1 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse0 (div (+ (* (- 1) .cse1) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse0 2))) (not (= (mod .cse0 2) 0)) (not (= 0 (mod (+ .cse1 c_main_~a~0) (- 2)))) (= (+ (- (* main_~y~0 (+ (* (- 5) c_main_~r~0) c_main_~s~0))) (+ (+ (* c_main_~p~0 c_main_~x~0) (- (* c_main_~x~0 (+ (* (- 5) c_main_~p~0) c_main_~q~0)))) (* main_~y~0 c_main_~r~0))) c_main_~a~0))))) (or (not (= (+ c_main_~v~0 c_main_~b~0) c_main_~c~0)) (= (let ((.cse2 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse2)) c_main_~r~0))) (+ (* c_main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* (+ (- (* c_main_~q~0 .cse2)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (let ((.cse4 (div (+ c_main_~b~0 (- c_main_~c~0)) (- 2)))) (or (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2)))) (forall ((main_~y~0 Int)) (or (not (= c_main_~a~0 (+ (* c_main_~p~0 c_main_~x~0) (* main_~y~0 c_main_~r~0)))) (= (let ((.cse3 (+ c_main_~k~0 5))) (+ (+ (* main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* c_main_~x~0 (+ c_main_~p~0 (- (* .cse3 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse3 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse4 2))) (not (= 0 (mod .cse4 2)))))) is different from false [2019-09-05 13:31:15,443 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 95 [2019-09-05 13:31:31,560 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 145 [2019-09-05 13:31:34,527 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 137 [2019-09-05 13:32:04,013 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-05 13:32:06,945 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 166 [2019-09-05 13:32:09,480 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-09-05 13:32:28,072 WARN L188 SmtUtils]: Spent 3.09 s on a formula simplification that was a NOOP. DAG size: 174