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-c6af20d [2019-09-03 21:09:26,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:09:26,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:09:26,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:09:26,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:09:26,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:09:26,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:09:26,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:09:26,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:09:26,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:09:26,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:09:26,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:09:26,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:09:26,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:09:26,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:09:26,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:09:26,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:09:26,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:09:26,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:09:26,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:09:26,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:09:26,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:09:26,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:09:26,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:09:26,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:09:26,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:09:26,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:09:26,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:09:26,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:09:26,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:09:26,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:09:26,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:09:26,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:09:26,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:09:26,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:09:26,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:09:26,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:09:26,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:09:26,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:09:26,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:09:26,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:09:26,265 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-03 21:09:26,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:09:26,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:09:26,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:09:26,280 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:09:26,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:09:26,281 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:09:26,281 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:09:26,281 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:09:26,281 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:09:26,282 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:09:26,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:09:26,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:09:26,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:09:26,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:09:26,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:09:26,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:09:26,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:09:26,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:09:26,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:09:26,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:09:26,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:09:26,284 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:09:26,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:09:26,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:09:26,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:09:26,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:09:26,285 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:09:26,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:09:26,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:09:26,286 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:09:26,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:09:26,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:09:26,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:09:26,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:09:26,332 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:09:26,333 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-03 21:09:26,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a948b0b1/f037baec651d448688e826e6b36d3c4f/FLAG2b3503576 [2019-09-03 21:09:26,910 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:09:26,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd3.c [2019-09-03 21:09:26,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a948b0b1/f037baec651d448688e826e6b36d3c4f/FLAG2b3503576 [2019-09-03 21:09:27,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a948b0b1/f037baec651d448688e826e6b36d3c4f [2019-09-03 21:09:27,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:09:27,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:09:27,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:09:27,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:09:27,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:09:27,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9fdd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27, skipping insertion in model container [2019-09-03 21:09:27,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,299 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:09:27,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:09:27,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:09:27,523 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:09:27,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:09:27,557 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:09:27,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27 WrapperNode [2019-09-03 21:09:27,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:09:27,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:09:27,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:09:27,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:09:27,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (1/1) ... [2019-09-03 21:09:27,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:09:27,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:09:27,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:09:27,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:09:27,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (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-03 21:09:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:09:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:09:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:09:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:09:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:09:27,981 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:09:27,982 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 21:09:27,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:09:27 BoogieIcfgContainer [2019-09-03 21:09:27,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:09:27,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:09:27,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:09:28,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:09:28,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:09:27" (1/3) ... [2019-09-03 21:09:28,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160ae6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:09:28, skipping insertion in model container [2019-09-03 21:09:28,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:09:27" (2/3) ... [2019-09-03 21:09:28,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160ae6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:09:28, skipping insertion in model container [2019-09-03 21:09:28,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:09:27" (3/3) ... [2019-09-03 21:09:28,010 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd3.c [2019-09-03 21:09:28,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:09:28,033 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:09:28,049 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:09:28,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:09:28,083 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:09:28,083 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:09:28,083 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:09:28,083 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:09:28,083 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:09:28,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:09:28,084 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:09:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-03 21:09:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:09:28,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:28,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:28,110 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2133473032, now seen corresponding path program 1 times [2019-09-03 21:09:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,233 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-03 21:09:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:09:28,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:28,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:09:28,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:09:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:09:28,256 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-03 21:09:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:28,273 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-09-03 21:09:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:09:28,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:09:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:28,283 INFO L225 Difference]: With dead ends: 29 [2019-09-03 21:09:28,284 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 21:09:28,286 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-03 21:09:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 21:09:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 21:09:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 21:09:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-03 21:09:28,329 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 10 [2019-09-03 21:09:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:28,330 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-03 21:09:28,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:09:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-03 21:09:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 21:09:28,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:28,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:28,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1704601660, now seen corresponding path program 1 times [2019-09-03 21:09:28,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:28,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:28,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:28,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 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-03 21:09:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,399 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-03 21:09:28,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:28,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:28,400 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-03 21:09:28,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 21:09:28,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:28,493 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-03 21:09:28,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:28,525 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-03 21:09:28,529 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:28,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-03 21:09:28,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:28,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:09:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:09:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:09:28,532 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-09-03 21:09:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:28,573 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-09-03 21:09:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:09:28,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-03 21:09:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:28,575 INFO L225 Difference]: With dead ends: 36 [2019-09-03 21:09:28,575 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 21:09:28,576 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-03 21:09:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 21:09:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-09-03 21:09:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 21:09:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-09-03 21:09:28,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 11 [2019-09-03 21:09:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:28,587 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-09-03 21:09:28,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:09:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-09-03 21:09:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 21:09:28,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:28,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:28,588 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1987085660, now seen corresponding path program 1 times [2019-09-03 21:09:28,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:28,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:28,609 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:28,609 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-03 21:09:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,638 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-03 21:09:28,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:28,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:28,639 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-03 21:09:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:09:28,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:28,725 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-03 21:09:28,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:28,787 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-03 21:09:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:28,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:09:28,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:28,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:28,797 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2019-09-03 21:09:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:28,868 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-09-03 21:09:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:09:28,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 21:09:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:28,870 INFO L225 Difference]: With dead ends: 40 [2019-09-03 21:09:28,871 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 21:09:28,871 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-03 21:09:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 21:09:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 21:09:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 21:09:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-09-03 21:09:28,880 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 14 [2019-09-03 21:09:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:28,881 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-09-03 21:09:28,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-09-03 21:09:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:09:28,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:28,882 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:28,883 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1574644974, now seen corresponding path program 1 times [2019-09-03 21:09:28,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:28,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:28,893 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:28,893 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:28,893 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) [2019-09-03 21:09:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:28,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:28,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 21:09:28,941 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [30], [58], [65], [68], [70], [76], [77], [78], [88] [2019-09-03 21:09:28,981 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:28,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:29,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:29,225 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-03 21:09:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:29,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:29,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:29,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:29,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 21:09:29,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:29,305 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-03 21:09:29,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:29,348 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-03 21:09:29,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:29,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-03 21:09:29,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:29,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:09:29,356 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 5 states. [2019-09-03 21:09:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:29,532 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2019-09-03 21:09:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:09:29,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 21:09:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:29,535 INFO L225 Difference]: With dead ends: 78 [2019-09-03 21:09:29,535 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 21:09:29,537 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-03 21:09:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 21:09:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2019-09-03 21:09:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 21:09:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-09-03 21:09:29,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 16 [2019-09-03 21:09:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:29,562 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-09-03 21:09:29,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-09-03 21:09:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:09:29,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:29,564 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-03 21:09:29,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1955242494, now seen corresponding path program 1 times [2019-09-03 21:09:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:29,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:29,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:29,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:29,591 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:29,591 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-03 21:09:29,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,606 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-03 21:09:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:29,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-03 21:09:29,622 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [32], [41], [65], [68], [70], [73], [75], [76], [77], [78], [80], [81], [82] [2019-09-03 21:09:29,626 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:29,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:29,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:29,693 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-03 21:09:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:29,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:29,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:29,694 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-03 21:09:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:29,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:09:29,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:29,774 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-03 21:09:29,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:29,817 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-03 21:09:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:09:29,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:29,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:29,822 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 5 states. [2019-09-03 21:09:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:29,888 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2019-09-03 21:09:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:09:29,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 21:09:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:29,890 INFO L225 Difference]: With dead ends: 66 [2019-09-03 21:09:29,890 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 21:09:29,891 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-03 21:09:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 21:09:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-03 21:09:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 21:09:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2019-09-03 21:09:29,900 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 19 [2019-09-03 21:09:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:29,901 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-09-03 21:09:29,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2019-09-03 21:09:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:09:29,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:29,902 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:29,902 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -697444338, now seen corresponding path program 1 times [2019-09-03 21:09:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:29,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:29,910 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:29,911 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:29,911 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:29,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:29,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-03 21:09:29,955 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [30], [32], [41], [58], [65], [68], [70], [76], [77], [78], [80] [2019-09-03 21:09:29,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:29,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:30,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:30,002 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-03 21:09:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:30,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:30,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:30,003 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-03 21:09:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:30,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 21:09:30,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:30,107 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-03 21:09:30,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:30,174 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-03 21:09:30,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:30,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-03 21:09:30,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:30,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 21:09:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 21:09:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 21:09:30,180 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 10 states. [2019-09-03 21:09:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:30,358 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-09-03 21:09:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:09:30,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-03 21:09:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:30,360 INFO L225 Difference]: With dead ends: 100 [2019-09-03 21:09:30,360 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 21:09:30,361 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-03 21:09:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 21:09:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-09-03 21:09:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 21:09:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2019-09-03 21:09:30,375 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 19 [2019-09-03 21:09:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:30,375 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2019-09-03 21:09:30,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 21:09:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2019-09-03 21:09:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 21:09:30,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:30,377 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-03 21:09:30,377 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1428232868, now seen corresponding path program 1 times [2019-09-03 21:09:30,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:30,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:30,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:30,387 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:30,388 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:30,388 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) [2019-09-03 21:09:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:30,416 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-03 21:09:30,417 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-03 21:09:30,419 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:30,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:30,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:30,443 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-03 21:09:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:30,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:30,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:30,444 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) [2019-09-03 21:09:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:30,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:09:30,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:30,517 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-03 21:09:30,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:30,556 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-03 21:09:30,560 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-03 21:09:30,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:30,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:09:30,561 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand 5 states. [2019-09-03 21:09:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:30,636 INFO L93 Difference]: Finished difference Result 138 states and 197 transitions. [2019-09-03 21:09:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:09:30,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-03 21:09:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:30,642 INFO L225 Difference]: With dead ends: 138 [2019-09-03 21:09:30,643 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 21:09:30,643 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-03 21:09:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 21:09:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2019-09-03 21:09:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 21:09:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2019-09-03 21:09:30,676 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 24 [2019-09-03 21:09:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:30,676 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2019-09-03 21:09:30,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2019-09-03 21:09:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 21:09:30,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:30,687 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-03 21:09:30,689 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash -369092908, now seen corresponding path program 1 times [2019-09-03 21:09:30,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:30,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:30,696 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:30,697 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:30,697 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-03 21:09:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:30,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-03 21:09:30,722 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-03 21:09:30,725 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:30,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:30,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:30,760 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-03 21:09:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:30,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:30,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:30,761 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-03 21:09:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:30,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:30,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:09:30,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:30,896 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-03 21:09:30,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:30,997 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-03 21:09:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-03 21:09:31,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 21:09:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 21:09:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:09:31,002 INFO L87 Difference]: Start difference. First operand 132 states and 191 transitions. Second operand 12 states. [2019-09-03 21:09:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:31,804 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2019-09-03 21:09:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 21:09:31,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-09-03 21:09:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:31,808 INFO L225 Difference]: With dead ends: 212 [2019-09-03 21:09:31,808 INFO L226 Difference]: Without dead ends: 212 [2019-09-03 21:09:31,809 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-03 21:09:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-03 21:09:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2019-09-03 21:09:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:09:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-03 21:09:31,828 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 24 [2019-09-03 21:09:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:31,829 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-03 21:09:31,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 21:09:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-03 21:09:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 21:09:31,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:31,831 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-03 21:09:31,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1127690622, now seen corresponding path program 1 times [2019-09-03 21:09:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:31,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:31,842 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:31,842 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:31,842 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:31,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:31,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:31,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2019-09-03 21:09:31,868 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-03 21:09:31,870 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:31,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:31,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:31,890 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-03 21:09:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:31,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:31,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:31,891 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-03 21:09:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:31,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:31,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:09:31,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:31,952 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-03 21:09:31,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:31,983 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-03 21:09:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:31,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:09:31,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:31,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:31,991 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 5 states. [2019-09-03 21:09:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:32,048 INFO L93 Difference]: Finished difference Result 328 states and 509 transitions. [2019-09-03 21:09:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:09:32,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-09-03 21:09:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:32,052 INFO L225 Difference]: With dead ends: 328 [2019-09-03 21:09:32,052 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 21:09:32,052 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-03 21:09:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 21:09:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 284. [2019-09-03 21:09:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-03 21:09:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 441 transitions. [2019-09-03 21:09:32,075 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 441 transitions. Word has length 29 [2019-09-03 21:09:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:32,076 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 441 transitions. [2019-09-03 21:09:32,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 441 transitions. [2019-09-03 21:09:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 21:09:32,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:32,078 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-03 21:09:32,078 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -184535106, now seen corresponding path program 2 times [2019-09-03 21:09:32,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:32,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:32,085 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:32,085 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:32,085 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-03 21:09:32,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:32,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:32,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:32,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:32,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:32,122 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-03 21:09:32,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:32,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:32,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 21:09:32,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:32,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 21:09:32,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:32,202 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-03 21:09:32,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:32,242 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-03 21:09:32,246 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:32,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:09:32,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:32,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:32,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:32,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:32,248 INFO L87 Difference]: Start difference. First operand 284 states and 441 transitions. Second operand 5 states. [2019-09-03 21:09:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:32,355 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2019-09-03 21:09:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:09:32,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-09-03 21:09:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:32,357 INFO L225 Difference]: With dead ends: 193 [2019-09-03 21:09:32,357 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 21:09:32,358 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-03 21:09:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 21:09:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-09-03 21:09:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 21:09:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2019-09-03 21:09:32,371 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 29 [2019-09-03 21:09:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:32,371 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2019-09-03 21:09:32,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2019-09-03 21:09:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 21:09:32,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:32,373 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-03 21:09:32,373 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:32,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1508679066, now seen corresponding path program 1 times [2019-09-03 21:09:32,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:32,384 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:32,384 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:32,384 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-03 21:09:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:32,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:32,416 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2019-09-03 21:09:32,417 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-03 21:09:32,421 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:32,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:32,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:32,465 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-03 21:09:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:32,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:32,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:32,466 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-03 21:09:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:32,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:32,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 21:09:32,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:32,684 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-03 21:09:32,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:32,921 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-03 21:09:32,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:32,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-03 21:09:32,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:32,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 21:09:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 21:09:32,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-03 21:09:32,931 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand 18 states. [2019-09-03 21:09:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:37,453 INFO L93 Difference]: Finished difference Result 386 states and 589 transitions. [2019-09-03 21:09:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 21:09:37,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-09-03 21:09:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:37,457 INFO L225 Difference]: With dead ends: 386 [2019-09-03 21:09:37,458 INFO L226 Difference]: Without dead ends: 383 [2019-09-03 21:09:37,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=283, Invalid=1199, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:09:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-03 21:09:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 294. [2019-09-03 21:09:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 21:09:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2019-09-03 21:09:37,480 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 41 [2019-09-03 21:09:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:37,481 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2019-09-03 21:09:37,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:09:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2019-09-03 21:09:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 21:09:37,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:37,484 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-03 21:09:37,484 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash -659177953, now seen corresponding path program 1 times [2019-09-03 21:09:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:37,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:37,493 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:37,494 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:37,494 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-03 21:09:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2019-09-03 21:09:37,522 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-03 21:09:37,524 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:37,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:37,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:37,544 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-03 21:09:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:37,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:09:37,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:09:37,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:37,685 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-03 21:09:37,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:37,781 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-03 21:09:37,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 21:09:37,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-03 21:09:37,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:37,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:09:37,786 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 5 states. [2019-09-03 21:09:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:37,837 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-09-03 21:09:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:09:37,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-03 21:09:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:37,841 INFO L225 Difference]: With dead ends: 298 [2019-09-03 21:09:37,841 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 21:09:37,842 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-03 21:09:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 21:09:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-03 21:09:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 21:09:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 435 transitions. [2019-09-03 21:09:37,862 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 435 transitions. Word has length 51 [2019-09-03 21:09:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:37,862 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 435 transitions. [2019-09-03 21:09:37,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 435 transitions. [2019-09-03 21:09:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 21:09:37,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:37,866 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-03 21:09:37,866 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1685131186, now seen corresponding path program 1 times [2019-09-03 21:09:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:37,885 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:37,887 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:37,887 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:09:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2019-09-03 21:09:37,919 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-03 21:09:37,920 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:37,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:37,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:37,955 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-03 21:09:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:37,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:37,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:37,956 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-03 21:09:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,974 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-03 21:09:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 21:09:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:38,025 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-03 21:09:38,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:38,061 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-03 21:09:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:09:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-09-03 21:09:38,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:09:38,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:09:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:09:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:09:38,066 INFO L87 Difference]: Start difference. First operand 298 states and 435 transitions. Second operand 5 states. [2019-09-03 21:09:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:38,126 INFO L93 Difference]: Finished difference Result 316 states and 446 transitions. [2019-09-03 21:09:38,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:09:38,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-03 21:09:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:38,129 INFO L225 Difference]: With dead ends: 316 [2019-09-03 21:09:38,129 INFO L226 Difference]: Without dead ends: 316 [2019-09-03 21:09:38,130 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-03 21:09:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-03 21:09:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2019-09-03 21:09:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 21:09:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2019-09-03 21:09:38,144 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 54 [2019-09-03 21:09:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:38,145 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2019-09-03 21:09:38,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:09:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2019-09-03 21:09:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 21:09:38,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:38,148 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-03 21:09:38,148 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash 812510334, now seen corresponding path program 2 times [2019-09-03 21:09:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:38,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:38,162 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:38,162 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:38,163 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:09:38,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:38,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:38,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:38,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:38,200 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-03 21:09:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:38,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:38,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 21:09:38,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:38,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 21:09:38,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:38,477 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-03 21:09:38,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:38,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 21:09:38,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:38,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-09-03 21:09:38,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:38,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 21:09:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 21:09:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-03 21:09:38,783 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand 21 states. [2019-09-03 21:09:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:40,693 INFO L93 Difference]: Finished difference Result 342 states and 492 transitions. [2019-09-03 21:09:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 21:09:40,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-09-03 21:09:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:40,696 INFO L225 Difference]: With dead ends: 342 [2019-09-03 21:09:40,696 INFO L226 Difference]: Without dead ends: 340 [2019-09-03 21:09:40,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:09:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-03 21:09:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 305. [2019-09-03 21:09:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-03 21:09:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2019-09-03 21:09:40,722 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 54 [2019-09-03 21:09:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:40,722 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2019-09-03 21:09:40,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 21:09:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2019-09-03 21:09:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 21:09:40,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:40,725 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-03 21:09:40,725 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:40,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1962864291, now seen corresponding path program 1 times [2019-09-03 21:09:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:40,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:40,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:40,743 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:40,743 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:40,743 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-03 21:09:40,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:40,764 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-03 21:09:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:40,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-03 21:09:40,784 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-03 21:09:40,787 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:40,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:40,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:40,832 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-03 21:09:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:40,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:40,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:40,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:40,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:40,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:40,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 21:09:40,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:41,303 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-03 21:09:41,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:41,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:46,980 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-03 21:09:46,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:46,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-09-03 21:09:46,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:46,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:09:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:09:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=656, Unknown=5, NotChecked=0, Total=756 [2019-09-03 21:09:46,985 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand 28 states. [2019-09-03 21:09:47,286 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-09-03 21:09:49,473 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 110 [2019-09-03 21:09:50,982 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-03 21:09:55,233 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)))) is different from true [2019-09-03 21:10:08,821 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2019-09-03 21:10:11,264 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 124 [2019-09-03 21:10:13,630 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-03 21:10:16,494 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-03 21:11:00,843 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 125 [2019-09-03 21:11:01,766 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-03 21:11:03,896 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 81 [2019-09-03 21:11:05,803 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-03 21:11:07,911 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 68 [2019-09-03 21:11:27,321 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 72 [2019-09-03 21:11:31,799 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 145 [2019-09-03 21:11:32,591 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2019-09-03 21:11:32,796 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-03 21:11:37,309 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-03 21:11:37,568 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-09-03 21:11:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:37,586 INFO L93 Difference]: Finished difference Result 393 states and 550 transitions. [2019-09-03 21:11:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 21:11:37,586 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2019-09-03 21:11:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:37,591 INFO L225 Difference]: With dead ends: 393 [2019-09-03 21:11:37,591 INFO L226 Difference]: Without dead ends: 389 [2019-09-03 21:11:37,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=656, Invalid=3490, Unknown=22, NotChecked=254, Total=4422 [2019-09-03 21:11:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-03 21:11:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 361. [2019-09-03 21:11:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-03 21:11:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 512 transitions. [2019-09-03 21:11:37,609 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 512 transitions. Word has length 68 [2019-09-03 21:11:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:37,610 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 512 transitions. [2019-09-03 21:11:37,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:11:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 512 transitions. [2019-09-03 21:11:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 21:11:37,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:37,612 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-03 21:11:37,612 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1959775462, now seen corresponding path program 2 times [2019-09-03 21:11:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:37,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:37,618 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:11:37,618 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:11:37,618 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-03 21:11:37,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:37,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:11:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:37,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:37,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:37,662 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) [2019-09-03 21:11:37,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:11:37,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:37,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 21:11:37,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:37,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 21:11:37,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:37,753 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-03 21:11:37,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:37,822 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-03 21:11:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:11:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-03 21:11:37,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:37,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 21:11:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 21:11:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:11:37,828 INFO L87 Difference]: Start difference. First operand 361 states and 512 transitions. Second operand 8 states. [2019-09-03 21:11:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:38,212 INFO L93 Difference]: Finished difference Result 457 states and 655 transitions. [2019-09-03 21:11:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 21:11:38,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-03 21:11:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:38,216 INFO L225 Difference]: With dead ends: 457 [2019-09-03 21:11:38,216 INFO L226 Difference]: Without dead ends: 457 [2019-09-03 21:11:38,217 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-03 21:11:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-03 21:11:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2019-09-03 21:11:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-03 21:11:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2019-09-03 21:11:38,241 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 76 [2019-09-03 21:11:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:38,242 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2019-09-03 21:11:38,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 21:11:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2019-09-03 21:11:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 21:11:38,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:38,244 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-03 21:11:38,244 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2085410328, now seen corresponding path program 2 times [2019-09-03 21:11:38,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:38,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:38,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:38,259 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:11:38,259 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:11:38,259 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-03 21:11:38,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:38,272 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-03 21:11:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:38,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:38,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:38,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:38,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:38,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:11:38,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:11:38,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:11:38,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:38,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 21:11:38,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:39,183 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-03 21:11:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:39,318 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-03 21:11:39,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:39,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:39,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 56 proven. 17 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:11:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:11:39,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-09-03 21:11:39,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:39,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 21:11:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 21:11:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-09-03 21:11:39,851 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 22 states. [2019-09-03 21:11:39,998 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~q~0 1) (= c_main_~a~0 c_main_~y~0) (= 0 (mod c_main_~s~0 (- 2))) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (= (+ c_main_~x~0 (* (- 1) c_main_~b~0)) (* c_main_~a~0 (* (- 1) c_main_~s~0))) (forall ((main_~d~0 Int)) (let ((.cse1 (* 2 main_~d~0))) (or (= c_main_~b~0 (let ((.cse0 (+ c_main_~k~0 .cse1))) (+ (+ (* c_main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* c_main_~x~0 (+ c_main_~p~0 (- (* c_main_~q~0 .cse0))))))) (- (* (+ c_main_~r~0 (- (* c_main_~s~0 .cse0))) c_main_~y~0))))) (not (= c_main_~c~0 (* c_main_~b~0 .cse1)))))) (= c_main_~p~0 0)) is different from false [2019-09-03 21:11:40,251 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-03 21:11:44,351 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-03 21:11:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:49,623 INFO L93 Difference]: Finished difference Result 445 states and 638 transitions. [2019-09-03 21:11:49,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:11:49,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2019-09-03 21:11:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:49,627 INFO L225 Difference]: With dead ends: 445 [2019-09-03 21:11:49,627 INFO L226 Difference]: Without dead ends: 439 [2019-09-03 21:11:49,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=227, Invalid=964, Unknown=3, NotChecked=66, Total=1260 [2019-09-03 21:11:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-03 21:11:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 349. [2019-09-03 21:11:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-03 21:11:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 492 transitions. [2019-09-03 21:11:49,651 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 492 transitions. Word has length 85 [2019-09-03 21:11:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:49,651 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 492 transitions. [2019-09-03 21:11:49,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 21:11:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 492 transitions. [2019-09-03 21:11:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 21:11:49,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:49,657 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-03 21:11:49,657 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 878206641, now seen corresponding path program 3 times [2019-09-03 21:11:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:49,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:49,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:49,666 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:11:49,669 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:11:49,669 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-03 21:11:49,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:49,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:11:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:49,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:49,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:49,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:49,719 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-03 21:11:49,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:11:49,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:11:49,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:11:49,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:49,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 21:11:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:50,194 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-03 21:11:50,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:51,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:59,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2)))))))))) is different from false [2019-09-03 21:12:01,960 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2)))))))))) is different from true [2019-09-03 21:12:16,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:22,295 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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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-03 21:12:24,302 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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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-03 21:12:30,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~b~0_BEFORE_CALL_118 Int) (v_prenex_4 Int) (v_main_~k~0_BEFORE_CALL_83 Int) (v_main_~y~0_BEFORE_CALL_89 Int) (v_prenex_3 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)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse11 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse11 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (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 (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) is different from false [2019-09-03 21:12:32,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:32,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:41,795 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-03 21:12:41,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:44,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-03 21:13:02,534 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-03 21:13:10,236 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-09-03 21:13:10,324 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 44 [2019-09-03 21:13:20,745 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-03 21:13:29,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-09-03 21:13:29,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 68 [2019-09-03 21:13:39,259 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-03 21:13:46,959 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-03 21:14:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 39 proven. 53 refuted. 72 times theorem prover too weak. 145 trivial. 17 not checked. [2019-09-03 21:14:09,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:14:09,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2019-09-03 21:14:09,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:14:09,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 21:14:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 21:14:09,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=875, Unknown=22, NotChecked=390, Total=1406 [2019-09-03 21:14:09,424 INFO L87 Difference]: Start difference. First operand 349 states and 492 transitions. Second operand 38 states. [2019-09-03 21:14:10,207 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-03 21:14:12,216 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-03 21:14:14,609 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-03 21:14:16,617 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse25 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse12 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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)))))))))) .cse12 (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 .cse12 (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 .cse12 (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-03 21:14:18,753 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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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-03 21:14:20,956 WARN L838 $PredicateComparison]: unable to prove that (and (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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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)))))))))) (not (= |c___VERIFIER_assert_#in~cond| 0)) (not (= 0 c___VERIFIER_assert_~cond)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-03 21:14:23,096 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| 1) (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2))))))))))) is different from false [2019-09-03 21:14:25,104 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2)))))))))) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-03 21:14:27,145 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2))))))))))) is different from false [2019-09-03 21:14:29,148 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse11 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse8 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse11)))) (.cse7 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse11))))) (let ((.cse10 (* .cse7 v_main_~y~0_BEFORE_CALL_88)) (.cse9 (* v_main_~x~0_BEFORE_CALL_91 .cse8))) (let ((.cse0 (+ .cse10 .cse9))) (or (not (= .cse0 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse0 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse4 (+ (- (* .cse6 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse2 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse6 v_prenex_2))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_88 .cse2)) (.cse5 (* v_main_~x~0_BEFORE_CALL_91 .cse4))) (let ((.cse1 (+ .cse3 .cse5))) (and (= .cse1 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse1 (+ (- (* (+ (* (- 2) .cse2) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse3 (+ (- (* (+ (* (- 2) .cse4) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse5))))) (= .cse1 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse0 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse7 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse8) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse9) .cse10))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2))))))))))) is different from true [2019-09-03 21:14:31,160 WARN L838 $PredicateComparison]: unable to prove that (and (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 (not (= 0 (mod v_main_~b~0_BEFORE_CALL_118 (- 2)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_83 v_main_~d~0_BEFORE_CALL_84))) (let ((.cse1 (+ (- (* .cse5 v_prenex_3)) v_main_~p~0_BEFORE_CALL_85)) (.cse0 (+ v_main_~r~0_BEFORE_CALL_85 (- (* .cse5 v_prenex_4))))) (let ((.cse3 (* v_main_~y~0_BEFORE_CALL_89 .cse0)) (.cse2 (* .cse1 v_main_~x~0_BEFORE_CALL_92))) (let ((.cse4 (+ .cse3 .cse2))) (or (= (+ (- (* (+ (* (- 2) .cse0) v_prenex_4) v_main_~y~0_BEFORE_CALL_89)) (+ (+ (- (* (+ (* (- 2) .cse1) v_prenex_3) v_main_~x~0_BEFORE_CALL_92)) .cse2) .cse3)) .cse4) (not (= (div (- v_main_~b~0_BEFORE_CALL_118) (- 2)) .cse4)) (not (= .cse4 (+ v_main_~c~0_BEFORE_CALL_91 (* (- 1) v_main_~v~0_BEFORE_CALL_93)))))))))) (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)))))))))) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~b~0_BEFORE_CALL_117 Int) (v_main_~k~0_BEFORE_CALL_82 Int) (v_main_~y~0_BEFORE_CALL_88 Int) (v_main_~r~0_BEFORE_CALL_84 Int) (v_main_~p~0_BEFORE_CALL_84 Int) (v_main_~x~0_BEFORE_CALL_91 Int) (main_~q~0 Int) (v_main_~v~0_BEFORE_CALL_92 Int) (v_main_~d~0_BEFORE_CALL_83 Int) (v_main_~c~0_BEFORE_CALL_90 Int) (v_main_~r~0_45 Int)) (let ((.cse23 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse20 (+ v_main_~p~0_BEFORE_CALL_84 (- (* main_~q~0 .cse23)))) (.cse19 (+ v_main_~r~0_BEFORE_CALL_84 (- (* v_main_~r~0_45 .cse23))))) (let ((.cse22 (* .cse19 v_main_~y~0_BEFORE_CALL_88)) (.cse21 (* v_main_~x~0_BEFORE_CALL_91 .cse20))) (let ((.cse12 (+ .cse22 .cse21))) (or (not (= .cse12 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90))) (not (= .cse12 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse18 (+ v_main_~k~0_BEFORE_CALL_82 v_main_~d~0_BEFORE_CALL_83))) (let ((.cse16 (+ (- (* .cse18 v_prenex_1)) v_main_~p~0_BEFORE_CALL_84)) (.cse14 (+ v_main_~r~0_BEFORE_CALL_84 (- (* .cse18 v_prenex_2))))) (let ((.cse15 (* v_main_~y~0_BEFORE_CALL_88 .cse14)) (.cse17 (* v_main_~x~0_BEFORE_CALL_91 .cse16))) (let ((.cse13 (+ .cse15 .cse17))) (and (= .cse13 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_92) v_main_~c~0_BEFORE_CALL_90)) (not (= .cse13 (+ (- (* (+ (* (- 2) .cse14) v_prenex_2) v_main_~y~0_BEFORE_CALL_88)) (+ .cse15 (+ (- (* (+ (* (- 2) .cse16) v_prenex_1) v_main_~x~0_BEFORE_CALL_91)) .cse17))))) (= .cse13 (div (- v_main_~b~0_BEFORE_CALL_117) (- 2))))))))) (= .cse12 (+ (- (* v_main_~y~0_BEFORE_CALL_88 (+ (* .cse19 (- 2)) v_main_~r~0_45))) (+ (+ (- (* (+ (* (- 2) .cse20) main_~q~0) v_main_~x~0_BEFORE_CALL_91)) .cse21) .cse22))) (not (= 0 (mod v_main_~b~0_BEFORE_CALL_117 (- 2))))))))))) is different from false [2019-09-03 21:14:34,075 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-03 21:15:08,545 WARN L188 SmtUtils]: Spent 10.70 s on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2019-09-03 21:15:10,819 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 (not (= 0 c___VERIFIER_assert_~cond)) (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) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from true [2019-09-03 21:15:16,029 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-03 21:15:19,870 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-09-03 21:15:45,729 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 68 [2019-09-03 21:16:08,659 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 114 [2019-09-03 21:16:19,086 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 99 [2019-09-03 21:16:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:38,573 INFO L93 Difference]: Finished difference Result 718 states and 1036 transitions. [2019-09-03 21:16:38,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 21:16:38,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 93 [2019-09-03 21:16:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:38,579 INFO L225 Difference]: With dead ends: 718 [2019-09-03 21:16:38,579 INFO L226 Difference]: Without dead ends: 714 [2019-09-03 21:16:38,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=371, Invalid=2507, Unknown=52, NotChecked=2040, Total=4970 [2019-09-03 21:16:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-03 21:16:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 577. [2019-09-03 21:16:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-03 21:16:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 833 transitions. [2019-09-03 21:16:38,605 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 833 transitions. Word has length 93 [2019-09-03 21:16:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:38,606 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 833 transitions. [2019-09-03 21:16:38,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 21:16:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 833 transitions. [2019-09-03 21:16:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 21:16:38,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:38,609 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-03 21:16:38,609 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1115368890, now seen corresponding path program 4 times [2019-09-03 21:16:38,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:38,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:38,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:38,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:38,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:38,615 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:16:38,615 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:16:38,615 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) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:16:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:38,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:16:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:38,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:38,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:38,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:38,666 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-03 21:16:38,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:38,695 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-03 21:16:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:38,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 21:16:38,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:39,250 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-03 21:16:39,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:39,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:40,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:40,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:40,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:17:15,750 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-03 21:17:15,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:17:15,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-09-03 21:17:15,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:17:15,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:17:15,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:17:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=973, Unknown=15, NotChecked=0, Total=1122 [2019-09-03 21:17:15,755 INFO L87 Difference]: Start difference. First operand 577 states and 833 transitions. Second operand 34 states. [2019-09-03 21:17:18,131 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2019-09-03 21:17:20,227 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~q~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)))))) (forall ((main_~y~0 Int)) (let ((.cse3 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse2 (div (+ (* (- 1) .cse3) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse2 2))) (not (= (mod .cse2 2) 0)) (not (= 0 (mod (+ .cse3 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_~r~0 1) (<= 1 c_main_~x~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))) (let ((.cse5 (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 ((.cse4 (+ 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 (- (* .cse4 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse4 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse5 2))) (not (= 0 (mod .cse5 2))))) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (= c_main_~p~0 0) (forall ((main_~y~0 Int)) (let ((.cse9 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse6 (div (+ (* (- 1) .cse9) c_main_~c~0) (- 2)))) (or (not (= (mod .cse6 2) 0)) (= c_main_~c~0 (let ((.cse7 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (* main_~y~0 .cse7) (let ((.cse8 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse8 c_main_~x~0) (- (* (+ c_main_~q~0 (* .cse8 (- 5))) c_main_~x~0))))) (- (* (+ c_main_~s~0 (* (- 5) .cse7)) main_~y~0))))) (not (= (mod (+ .cse9 c_main_~c~0) (- 2)) 0)) (not (= c_main_~c~0 (div .cse6 2)))))))) is different from false [2019-09-03 21:17:57,100 WARN L188 SmtUtils]: Spent 10.43 s on a formula simplification that was a NOOP. DAG size: 81 [2019-09-03 21:18:03,395 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-03 21:18:07,683 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-03 21:18:22,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (* 2 c_main_~v~0)) (.cse16 (div (+ c_main_~b~0 (- c_main_~c~0)) (- 2)))) (let ((.cse7 (not (= .cse13 .cse16))) (.cse3 (* c_main_~y~0 c_main_~s~0)) (.cse4 (* c_main_~q~0 c_main_~x~0)) (.cse5 (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2)))))) (and (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)))))) (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 .cse5 (= (let ((.cse6 (+ c_main_~k~0 (* 4 c_main_~d~0) 1))) (+ (- (* (+ (- (* .cse6 c_main_~s~0)) c_main_~r~0) c_main_~y~0)) (+ .cse3 (+ .cse4 (- (* (+ (- (* .cse6 c_main_~q~0)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0) .cse7) (or (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 ((.cse8 (+ c_main_~k~0 (* 4 c_main_~d~0) 1))) (+ (- (* (+ (- (* .cse8 c_main_~s~0)) c_main_~r~0) main_~y~0)) (+ (* main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* (+ (- (* .cse8 c_main_~q~0)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0))) .cse5 .cse7) (forall ((main_~y~0 Int)) (let ((.cse10 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse9 (div (+ (* (- 1) .cse10) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse9 2))) (not (= (mod .cse9 2) 0)) (not (= 0 (mod (+ .cse10 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 ((.cse11 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse11)) c_main_~r~0))) (+ .cse3 (+ .cse4 (- (* (+ (- (* c_main_~q~0 .cse11)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (or (= c_main_~b~0 (+ (+ .cse3 (+ (- (* (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))) c_main_~x~0)) .cse4)) (- (* c_main_~y~0 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))))) (not (= c_main_~c~0 0))) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (or (= c_main_~b~0 (let ((.cse12 (+ c_main_~k~0 (* 2 c_main_~d~0) 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse12)) c_main_~r~0))) (+ .cse3 (+ (- (* (+ (- (* c_main_~q~0 .cse12)) c_main_~p~0) c_main_~x~0)) .cse4))))) (not (= (+ .cse13 c_main_~b~0) c_main_~c~0))) (= c_main_~q~0 1) (or (not (= c_main_~v~0 c_main_~c~0)) (= c_main_~b~0 (let ((.cse14 (+ c_main_~k~0 c_main_~d~0))) (+ (+ .cse3 (+ .cse4 (- (* c_main_~x~0 (+ c_main_~p~0 (- (* .cse14 c_main_~q~0))))))) (- (* c_main_~y~0 (+ (- (* .cse14 c_main_~s~0)) c_main_~r~0))))))) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (or .cse5 (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 ((.cse15 (+ 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 (- (* .cse15 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse15 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse16 2))) (not (= 0 (mod .cse16 2)))) (= c_main_~p~0 0)))) is different from false [2019-09-03 21:18:34,526 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 73 [2019-09-03 21:18:41,691 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-09-03 21:18:49,758 WARN L188 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 133 [2019-09-03 21:18:58,968 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-03 21:19:09,317 WARN L188 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 211 DAG size of output: 185 [2019-09-03 21:19:11,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (* 2 c_main_~v~0)) (.cse15 (div (+ c_main_~b~0 (- c_main_~c~0)) (- 2)))) (let ((.cse6 (not (= .cse12 .cse15))) (.cse4 (* c_main_~y~0 c_main_~s~0)) (.cse5 (* c_main_~q~0 c_main_~x~0)) (.cse2 (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2)))))) (and (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_~k~0 4) (or .cse2 (= (let ((.cse3 (+ c_main_~k~0 (* 4 c_main_~d~0) 1))) (+ (- (* (+ (- (* .cse3 c_main_~s~0)) c_main_~r~0) c_main_~y~0)) (+ .cse4 (+ .cse5 (- (* (+ (- (* .cse3 c_main_~q~0)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0) .cse6) (or (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 ((.cse7 (+ c_main_~k~0 (* 4 c_main_~d~0) 1))) (+ (- (* (+ (- (* .cse7 c_main_~s~0)) c_main_~r~0) main_~y~0)) (+ (* main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* (+ (- (* .cse7 c_main_~q~0)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0))) .cse2 .cse6) (forall ((main_~y~0 Int)) (let ((.cse9 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse8 (div (+ (* (- 1) .cse9) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse8 2))) (not (= (mod .cse8 2) 0)) (not (= 0 (mod (+ .cse9 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 ((.cse10 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse10)) c_main_~r~0))) (+ .cse4 (+ .cse5 (- (* (+ (- (* c_main_~q~0 .cse10)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (= (+ (* c_main_~p~0 c_main_~x~0) (* c_main_~y~0 c_main_~r~0)) (+ (* 4 c_main_~b~0) c_main_~c~0)) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (or (= c_main_~b~0 (let ((.cse11 (+ c_main_~k~0 (* 2 c_main_~d~0) 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse11)) c_main_~r~0))) (+ .cse4 (+ (- (* (+ (- (* c_main_~q~0 .cse11)) c_main_~p~0) c_main_~x~0)) .cse5))))) (not (= (+ .cse12 c_main_~b~0) c_main_~c~0))) (= c_main_~q~0 1) (or (not (= c_main_~v~0 c_main_~c~0)) (= c_main_~b~0 (let ((.cse13 (+ c_main_~k~0 c_main_~d~0))) (+ (+ .cse4 (+ .cse5 (- (* c_main_~x~0 (+ c_main_~p~0 (- (* .cse13 c_main_~q~0))))))) (- (* c_main_~y~0 (+ (- (* .cse13 c_main_~s~0)) c_main_~r~0))))))) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (or .cse2 (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 ((.cse14 (+ 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 (- (* .cse14 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse14 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse15 2))) (not (= 0 (mod .cse15 2)))) (= c_main_~p~0 0)))) is different from false [2019-09-03 21:19:15,994 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-03 21:19:18,064 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~q~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_~k~0 4) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (= (+ (* c_main_~p~0 c_main_~x~0) (* c_main_~y~0 c_main_~r~0)) (+ (* 4 c_main_~b~0) c_main_~c~0)) (let ((.cse3 (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 ((.cse2 (+ 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 (- (* .cse2 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse2 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse3 2))) (not (= 0 (mod .cse3 2))))) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (= c_main_~p~0 0)) is different from false [2019-09-03 21:19:25,649 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 c_main_~v~0)) (.cse4 (* c_main_~y~0 c_main_~s~0)) (.cse5 (* c_main_~q~0 c_main_~x~0)) (.cse2 (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))) (.cse7 (div (+ c_main_~b~0 (- c_main_~c~0)) (- 2)))) (and (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_~k~0 4) (or .cse2 (= (let ((.cse3 (+ c_main_~k~0 (* 4 c_main_~d~0) 1))) (+ (- (* (+ (- (* .cse3 c_main_~s~0)) c_main_~r~0) c_main_~y~0)) (+ .cse4 (+ .cse5 (- (* (+ (- (* .cse3 c_main_~q~0)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0) (not (= .cse6 .cse7))) (or (not (= (+ c_main_~v~0 c_main_~b~0) c_main_~c~0)) (= (let ((.cse8 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse8)) c_main_~r~0))) (+ .cse4 (+ .cse5 (- (* (+ (- (* c_main_~q~0 .cse8)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (= (+ (* c_main_~p~0 c_main_~x~0) (* c_main_~y~0 c_main_~r~0)) (+ (* 4 c_main_~b~0) c_main_~c~0)) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (forall ((main_~y~0 Int)) (let ((.cse12 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse9 (div (+ (* (- 1) .cse12) c_main_~c~0) (- 2)))) (or (not (= (mod .cse9 2) 0)) (= c_main_~c~0 (let ((.cse10 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))) (+ (+ (* main_~y~0 .cse10) (let ((.cse11 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))))) (+ (* .cse11 c_main_~x~0) (- (* (+ c_main_~q~0 (* .cse11 (- 5))) c_main_~x~0))))) (- (* (+ c_main_~s~0 (* (- 5) .cse10)) main_~y~0))))) (not (= (mod (+ .cse12 c_main_~c~0) (- 2)) 0)) (not (= c_main_~c~0 (div .cse9 2))))))) (or (= c_main_~b~0 (let ((.cse13 (+ c_main_~k~0 (* 2 c_main_~d~0) 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse13)) c_main_~r~0))) (+ .cse4 (+ (- (* (+ (- (* c_main_~q~0 .cse13)) c_main_~p~0) c_main_~x~0)) .cse5))))) (not (= (+ .cse6 c_main_~b~0) c_main_~c~0))) (= c_main_~q~0 1) (or (not (= c_main_~v~0 c_main_~c~0)) (= c_main_~b~0 (let ((.cse14 (+ c_main_~k~0 c_main_~d~0))) (+ (+ .cse4 (+ .cse5 (- (* c_main_~x~0 (+ c_main_~p~0 (- (* .cse14 c_main_~q~0))))))) (- (* c_main_~y~0 (+ (- (* .cse14 c_main_~s~0)) c_main_~r~0))))))) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (or .cse2 (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 ((.cse15 (+ 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 (- (* .cse15 c_main_~q~0))))))) (- (* (+ c_main_~r~0 (- (* .cse15 c_main_~s~0))) main_~y~0)))) c_main_~b~0))) (not (= c_main_~b~0 (div .cse7 2))) (not (= 0 (mod .cse7 2)))) (= c_main_~p~0 0))) is different from false [2019-09-03 21:19:32,829 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-09-03 21:19:35,100 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-03 21:19:35,301 WARN L860 $PredicateComparison]: unable to prove that (and (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 ((.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-03 21:19:43,058 WARN L188 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 160 DAG size of output: 132 [2019-09-03 21:19:47,980 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-03 21:19:50,159 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_~q~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)))))) (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))))))))))) (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))))) (or (not (= (+ c_main_~v~0 c_main_~b~0) c_main_~c~0)) (= (let ((.cse7 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse7)) c_main_~r~0))) (+ .cse3 (+ .cse4 (- (* (+ (- (* c_main_~q~0 .cse7)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (or (= c_main_~b~0 (+ (+ .cse3 (+ (- (* (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0))) c_main_~x~0)) .cse4)) (- (* c_main_~y~0 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0))))) (not (= c_main_~c~0 0))) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (= c_main_~p~0 0))) is different from false [2019-09-03 21:20:37,855 WARN L188 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 192 DAG size of output: 166 [2019-09-03 21:20:43,016 WARN L188 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-09-03 21:20:47,264 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_~q~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)))))) (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))))))))))) (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))))) (or (not (= (+ c_main_~v~0 c_main_~b~0) c_main_~c~0)) (= (let ((.cse7 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse7)) c_main_~r~0))) (+ .cse3 (+ .cse4 (- (* (+ (- (* c_main_~q~0 .cse7)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (= c_main_~p~0 0))) is different from false [2019-09-03 21:21:00,465 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 146 [2019-09-03 21:21:06,865 WARN L188 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2019-09-03 21:21:15,595 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2019-09-03 21:21:18,752 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 173 DAG size of output: 147 [2019-09-03 21:21:20,818 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~q~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)))))) (forall ((main_~y~0 Int)) (let ((.cse3 (+ (* c_main_~q~0 c_main_~x~0) (* main_~y~0 c_main_~s~0)))) (let ((.cse2 (div (+ (* (- 1) .cse3) c_main_~a~0) (- 2)))) (or (not (= c_main_~a~0 (div .cse2 2))) (not (= (mod .cse2 2) 0)) (not (= 0 (mod (+ .cse3 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 ((.cse4 (+ c_main_~k~0 c_main_~d~0 1))) (+ (- (* c_main_~y~0 (+ (- (* c_main_~s~0 .cse4)) c_main_~r~0))) (+ (* c_main_~y~0 c_main_~s~0) (+ (* c_main_~q~0 c_main_~x~0) (- (* (+ (- (* c_main_~q~0 .cse4)) c_main_~p~0) c_main_~x~0)))))) c_main_~b~0)) (= c_main_~r~0 1) (<= 1 c_main_~x~0) (= c_main_~b~0 c_main_~x~0) (= c_main_~s~0 0) (= c_main_~p~0 0)) is different from false [2019-09-03 21:21:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:21:20,822 INFO L93 Difference]: Finished difference Result 775 states and 1130 transitions. [2019-09-03 21:21:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 21:21:20,822 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 115 [2019-09-03 21:21:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:21:20,827 INFO L225 Difference]: With dead ends: 775 [2019-09-03 21:21:20,827 INFO L226 Difference]: Without dead ends: 771 [2019-09-03 21:21:20,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 191.3s TimeCoverageRelationStatistics Valid=757, Invalid=4047, Unknown=66, NotChecked=1450, Total=6320 [2019-09-03 21:21:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-03 21:21:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 666. [2019-09-03 21:21:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-03 21:21:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 970 transitions. [2019-09-03 21:21:20,853 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 970 transitions. Word has length 115 [2019-09-03 21:21:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:21:20,853 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 970 transitions. [2019-09-03 21:21:20,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 21:21:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 970 transitions. [2019-09-03 21:21:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 21:21:20,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:21:20,857 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:21:20,858 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:21:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:21:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1701928422, now seen corresponding path program 5 times [2019-09-03 21:21:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:21:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:21:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:21:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:21:20,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:21:20,865 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:21:20,865 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:21:20,865 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:21:20,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:21:20,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:21:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:21:20,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:21:20,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:21:20,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:21:20,939 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:21:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:21:20,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:21:21,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:21:21,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:21:21,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 21:21:21,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:21:31,504 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-03 21:21:31,736 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-03 21:21:32,622 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-03 21:21:32,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 96 proven. 64 refuted. 21 times theorem prover too weak. 709 trivial. 0 not checked. [2019-09-03 21:21:32,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:21:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:38,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:41,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~q~0_BEFORE_CALL_150 Int) (v_main_~y~0_BEFORE_CALL_155 Int) (v_main_~r~0_BEFORE_CALL_152 Int) (v_main_~b~0_BEFORE_CALL_183 Int) (v_main_~p~0_BEFORE_CALL_152 Int) (v_main_~c~0_BEFORE_CALL_156 Int) (v_main_~x~0_BEFORE_CALL_159 Int) (v_main_~s~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_148 Int) (main_~d~0 Int)) (or (not (= (* main_~d~0 v_main_~b~0_BEFORE_CALL_183) (+ (* (- 1) v_main_~b~0_BEFORE_CALL_183) v_main_~c~0_BEFORE_CALL_156))) (= v_main_~b~0_BEFORE_CALL_183 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_148 main_~d~0 1))) (+ (- (* v_main_~y~0_BEFORE_CALL_155 (+ (- (* .cse0 v_main_~s~0_BEFORE_CALL_150)) v_main_~r~0_BEFORE_CALL_152))) (+ (+ (* v_main_~x~0_BEFORE_CALL_159 v_main_~q~0_BEFORE_CALL_150) (- (* v_main_~x~0_BEFORE_CALL_159 (+ v_main_~p~0_BEFORE_CALL_152 (- (* .cse0 v_main_~q~0_BEFORE_CALL_150)))))) (* v_main_~y~0_BEFORE_CALL_155 v_main_~s~0_BEFORE_CALL_150))))) (not (= (mod (+ v_main_~b~0_BEFORE_CALL_183 v_main_~c~0_BEFORE_CALL_156) 2) 0)) (exists ((v_prenex_42 Int)) (and (not (= (let ((.cse1 (+ v_prenex_42 v_main_~k~0_BEFORE_CALL_148 1))) (+ (- (* v_main_~y~0_BEFORE_CALL_155 (+ (- (* v_main_~s~0_BEFORE_CALL_150 .cse1)) v_main_~r~0_BEFORE_CALL_152))) (+ (* v_main_~y~0_BEFORE_CALL_155 v_main_~s~0_BEFORE_CALL_150) (+ (* v_main_~x~0_BEFORE_CALL_159 v_main_~q~0_BEFORE_CALL_150) (- (* (+ v_main_~p~0_BEFORE_CALL_152 (- (* .cse1 v_main_~q~0_BEFORE_CALL_150))) v_main_~x~0_BEFORE_CALL_159)))))) v_main_~b~0_BEFORE_CALL_183)) (= (* v_prenex_42 v_main_~b~0_BEFORE_CALL_183) (+ (* (- 1) v_main_~b~0_BEFORE_CALL_183) v_main_~c~0_BEFORE_CALL_156)))))) is different from false [2019-09-03 21:21:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:41,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:47,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:21:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 84 proven. 95 refuted. 2 times theorem prover too weak. 709 trivial. 0 not checked. [2019-09-03 21:21:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:21:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-09-03 21:21:47,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:21:47,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:21:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:21:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=958, Unknown=10, NotChecked=0, Total=1122 [2019-09-03 21:21:47,892 INFO L87 Difference]: Start difference. First operand 666 states and 970 transitions. Second operand 34 states. [2019-09-03 21:21:56,924 WARN L188 SmtUtils]: Spent 7.66 s on a formula simplification that was a NOOP. DAG size: 142 [2019-09-03 21:22:05,312 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-03 21:22:25,473 WARN L188 SmtUtils]: Spent 11.47 s on a formula simplification that was a NOOP. DAG size: 139 [2019-09-03 21:22:36,874 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-03 21:22:57,685 WARN L188 SmtUtils]: Spent 6.38 s on a formula simplification that was a NOOP. DAG size: 109 [2019-09-03 21:23:09,159 WARN L188 SmtUtils]: Spent 4.48 s on a formula simplification that was a NOOP. DAG size: 97 [2019-09-03 21:23:20,620 WARN L188 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-03 21:23:36,276 WARN L188 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-03 21:23:58,051 WARN L188 SmtUtils]: Spent 7.45 s on a formula simplification that was a NOOP. DAG size: 102